arXiv (All)
open access
Convergence Guarantees of Gradient Descent for Neural Networks via Generalized Lipschitz Smoothness
We establish the first convergence guarantees of gradient descent for general feedforward neural networks of any width or depth, with any initialization or dataset. We only assume that the activation functions are linearly bounded, Lipschitz continuous, and Lipschitz smooth---properties that hold fo
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
- Combined First- and Second-order directions for Deep Neural Networks Training#970123
- Revisiting Approximate Metric Optimization in the Age of Deep Neural Networks#19754
- Upper Bounds on the Generalization Error of Deep Learning Models via Local Robustness and Stability#280214
- Mildly Overparameterized ReLU Networks on Orthogonal Data: Incremental Learning and Implicit Bias#229507
- Uniform a priori bounds and error analysis for the Adam stochastic gradient descent optimization method#819326
Record · ID 1115573
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