Answers are grounded in this paper and cite their sources.
Gradient descent is a fundamental algorithm in machine learning and statistical inference. Performance estimation provides a systematic framework for obtaining sharp convergence bounds through semidefinite programming. We study the worst-case performance of constant-stepsize gradient descent over the class of L-smooth functions satisfying the $μ$-Polyak--Łojasiewicz (PŁ) inequality. We formulate the N-step objective-gap analysis as a semidefinite programming (SDP) relaxation based on pairwise smoothness constraints and pointwise PŁ inequalities. Since an exact interpolation condition for smooth PŁ functions is not currently available, the resulting SDP provides a valid upper bound on the true worst-case performance. We solve a reduced SDP retaining only consecutive-pair smoothness constraints analytically for every horizon N and every stepsize t∈(0,2/L). The solution exhibits three stepsize regimes. For $0
No takes yet. Share an insight, caveat, or question.
Hong et al. (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: