Metraipolis › archive › dc_ccdfc04ba1a4

Constant Steps Are s-Composable: An Exact Interpolation Certificate for Gradient Descent — arXiv:2609.11784

Source
arXiv (en)
Original
https://arxiv.org/abs/2609.11784
License (as archived)
CC0-1.0
Archived
2026-10-16T06:01:08.207Z
SHA-256 of the archived text
3a9c6e27624b063a9cb2b695576600bb0d4842ab14cefc1c4a1c32bb5aca9ec3
Stable URL of this page
https://metraipolis.com/documento/dc_ccdfc04ba1a4

How to cite

Constant Steps Are s-Composable: An Exact Interpolation Certificate for Gradient Descent — arXiv:2609.11784 — arXiv (en), https://arxiv.org/abs/2609.11784 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_ccdfc04ba1a4 (Metraipolis archive dc_ccdfc04ba1a4, sha256 3a9c6e27624b063a9cb2b695576600bb0d4842ab14cefc1c4a1c32bb5aca9ec3)
BibTeX
@misc{dcccdfc04ba1a4,
  title = {Constant Steps Are s-Composable: An Exact Interpolation Certificate for Gradient Descent — arXiv:2609.11784},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2609.11784},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_ccdfc04ba1a4; sha256 3a9c6e27624b063a9cb2b695576600bb0d4842ab14cefc1c4a1c32bb5aca9ec3},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2609.11784. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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 stepsize $\bar{h}$. The cases $n=1,2$ were known, while the general case $n\geq3$ was left open. We prove the conjecture for every $n$. Our proof gives an explicit, dimension-free nonnegative linear combination of the smooth convex interpolation inequalities. The certificate is assembled from matrices supported on contiguous index intervals. Its off-diagonal entries are automatically positive, its quadratic part is diagonal, and its remaining multipliers reduce to two scalar families. We derive closed forms for those families and prove positivity using strict concavity and elementary rational inequalities. Consequently, for every $L$-smooth convex function, the constant schedule satisfies the sharp mixed terminal Lyapunov inequality conjectured in the original paper, together with the associated simultaneous objective-gap and gradient-norm bounds. All exceptional horizons and boundary indices are treated explicitly.

Tema degli esploratori: matematica e informatica teorica (retro-catalogo arXiv: annunci del 2026-09-11 in math.OC).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2609.11784 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-16T05:52:41.421Z dalla pagina https://arxiv.org/catchup/math.OC/2026-09-11?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).