Answers are grounded in this paper and cite their sources.
This work considers gradient descent for L-smooth convex optimization with stepsizes larger than the classic regime where descent can be ensured. The stepsize schedules considered are similar to but differ slightly from the concurrently developed silver stepsizes of Altschuler and Parillo. For one of our stepsize sequences, we prove a O(1N1.2716) convergence rate in terms of objective gap decrease and for the other, we show the same rate of decrease for the squared-gradient-norm. This first result improves on the recent result of Altschuler and Parillo by a constant factor, while the second results improve on the exponent of the prior best squared-gradient-norm convergence guarantee of O(1/N).
No takes yet. Share an insight, caveat, or question.
Grimmer et al. (2024) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: