Answers are grounded in this paper and cite their sources.
This work considers stepsize schedules for gradient descent on smooth strongly convex objectives. We develop a curvature-dependent concatenation framework for constructing stepsize schedules of arbitrary length with sharp worst-case guarantees. Within this framework, we introduce two families of schedules for the function-value gap and gradient norm of the last iterate, respectively. For each fixed condition number $κ=L/μ>1$, both families attain iteration complexity Θ(κ^ρlog(1/ε)) for sufficiently small $ε$, where ρ=log√2+12≈0.7864. This complexity is optimal up to a subpolynomial factor in $κ$ among predetermined nonnegative stepsize schedules. The framework also recovers the strongly convex silver schedule at power-of-two iteration budgets and applies to smooth convex and smooth weakly convex functions.
No takes yet. Share an insight, caveat, or question.
Zhang et al. (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: