arXiv (All)
open access
Sharp Initialization Guarantees for the Heavy-Ball Method
The heavy-ball method can accelerate convergence near the minimizer, but it may also enter persistent oscillations on general strongly convex objectives. How should it be initialized to reliably realize this local advantage? We study the initialization neighborhood in which convergence can be guaran
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
- Mixed precision strategies for preconditioned GMRES: a comprehensive analysis#200670
- Isotropic Gaussian Processes Improve Vanilla Bayesian Optimization in High Dimensions#1201793
- Dynamics of Gradient Descent with Large Step Size Near a Manifold of Flat Minima#974489
- Numerical viscosity solutions to Hamilton-Jacobi equations via a Carleman estimate and the convexification method#1110031
- Practical Regularized Quasi-Newton Methods with Inexact Function Values#1327345
Record · ID 1234794
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