arXiv (All)
open access
Constant Steps Are s-Composable: An Exact Interpolation Certificate for Gradient Descent
Grimmer, Shu, and Wang asked whether a balanced constant schedule is $s$-composable at every horizon. More precisely, for an integer $n\geq 1$, let $\bar{h}=1+r$, where $r\in(0,1)$ is the unique solution of $$r^n\bigl(1+n(1+r)\bigr)=1,$$ and run gradient descent for $n$ steps with normalized stepsiz
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
- Metaplasticity as adaptive gradient preconditioning for incremental learning#609072
- Random Reshuffling Dominates Stochastic Gradient Descent#324881
- Anytime Training with Schedule-Free Spectral Optimization#1115547
- Counterexamples for BFGS-type methods under arbitrary strong Wolfe constants#996516
- When Does Scale-Invariant Optimization Become Unstable? An Exact Schedule Law with Weight Decay#668026
Record · ID 999470
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