arXiv (All)
open access
Gradient descent avoids strict saddles with a simple line-search method too
It is known that gradient descent (GD) on a $C^2$ cost function generically avoids strict saddle points when using a small, constant step size. However, no such guarantee existed for GD with a line-search method. We provide one for a modified version of the standard Armijo backtracking method with g
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
- Saddle-Point Problems with a Low-Dimensional Block Do Not Need Accurate Inner Solves#1116772
- A multilayered framework for advancing rapid and cost-effective electric power system decarbonization.#199215
- On the Worst-Case Analysis of Cyclic Block Coordinate Descent type Algorithms#635617
- On the Worst-Case Analysis of Cyclic Block Coordinate Descent type Algorithms#633268
- A Kernel-Aware Two-Grid Preconditioner for Cell-Centered Nearly Incompressible Elasticity#1143472
Record · ID 1061612
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