arXiv (All)
open access
On the robustness of noisy solutions in non-convex neural networks
Optimization in non-convex neural network models is strongly influenced by the geometry of the solution space: sparse, isolated, point-like clusters are typically algorithmically inaccessible, whereas wide and flat regions can be found efficiently despite being relatively rare. At zero temperature t
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Convex Optimization Is Free When Accuracy Is Expensive#1130006
- Non-linear gravitational clustering: smooth halos, substructures and scaling exponents#1053319
- Models Designed to Forget: Machine Unlearning via Key Deletion#1128565
- Dynamics of gravitational clustering III. The quasi-linear regime for some non-Gaussian initial conditions#1053326
- Misspecification, Nonstationarity, and Approximate Inference in Gaussian Processes and Bayesian Neural Networks#643805
Record · ID 1105120
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive