- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
The paper studies accelerated convergence of gradient descent via predetermined step sizes. The paper analyzes two existing families: symmetric ConPP/OBS-S schedules and asymmetric ConPD/OBS-F schedules. For ConPP/OBS-S schedules, the paper shows that balanced splitting is the optimal schedule, and provide a tight guarantee that depends on a periodic function . The key ingredient of the proof is a local four-point rearrangement inequality and an induction to bound every possible split. For ConPD/OBS-F, the paper proves the same convergence exponent and a different, nonconstant periodic coefficient appearing asymptotically. although balanced splits might not be optimal. To prove this, the strategy is to compare the schedule with the symmetric recursion, then show that the coefficient sequence decreases and is bounded below whenever the time horizon doubles thus converges, and control neighboring coefficients to combine these limits into one continuous periodic profile.
Critical strengths
- The paper resolves an explicit conjecture regarding a family of step size schedules: it characterizes all symmetric schedules for ConPP/OBS-S and prove the optimality of the balanced splitting.
- Despite the fact that the asymmetric case appears more challenging, the paper still establishes uniform convergence and provides some characterization of the coefficient .
- The paper guarantees a sharp convergence for ConPP/OBS-S with balanced split and also identifies the guarantees for the coefficient function in the convergence of the asymmetric case.
Critical weaknesses
- The main limitation of the paper is the optimality is only restricted within the ConPP/OBS-S recursive family. In terms of improvement in the convergence, the exponent is already known from prior work, the paper only improves in the leading constant (or rather the coefficient ), which is very close to 1.
- The characterization of the asymmetric schedules is incomplete (not necessarily a weakness though), while the exponent in the convergence has already been shown in prior works.
Questions for authors
N/A
3 comments
Thank you for your response. I agree with the authors that understanding acceleration via predetermined stepsizes is an important problem and I think the paper has made nice contributions. However, my concerns remain as I still think ConPP/OBS-S is rather restricted and in terms of convergence behavior, most was known before. Also the characterization of the asymmetric schedules has room for improvement. Therefore I maintain my current assessment.
Thank you for your thoughtful follow-up and careful consideration of our work. We sincerely appreciate your constructive feedback and your recognition of our contributions.
We thank the reviewer for the assessment of our work and for highlighting the contributions and limitations of both the symmetric and asymmetric analyses. We clarify the scope and significance of our results below.
1. Significance of the recursive families.
We would first like to emphasize the importance of the recursive families studied in this paper. Recursive composition has been a central approach to constructing accelerated GD schedules with predetermined stepsizes. The ConPP/OBS-S family includes the celebrated Silver schedule and extends its construction to arbitrary horizons, while ConPD/OBS-F further optimizes the worst-case objective-gap guarantee. Moreover, Grimmer et al. (2025b, Conjecture 1) conjectured that OBS-F achieves the minimax guarantee among all predetermined GD schedules. Thus, understanding these families is an important step toward understanding the limits of acceleration through stepsize design.
2. Optimality and phase law for the symmetric family.
While the Silver exponent was already known, the optimal way to construct these recursive schedules at arbitrary horizons, and the precise behavior of their convergence guarantees, remained unresolved. Our paper addresses both questions.
For the symmetric family, we resolve an explicit conjecture of Zhang & Jiang (2026) by proving that balanced splitting is always optimal. We further characterize all optimal recursive constructions and obtain an efficient algorithm for evaluating their optimal guarantees. These results provide a complete structural characterization of the symmetric recursive optimization problem.
We acknowledge that the numerical variation of the symmetric coefficient is small. However, our phase law reveals a persistent dependence on the time horizon that is invisible in the previously known convergence rate. Even after accounting for the Silver exponent, the sharp convergence coefficient continues to vary with the horizon rather than approaching a single constant. Moreover, these guarantees are tight and attained by explicit worst-case examples. Thus, our results provide a precise characterization of the actual worst-case behavior of these accelerated schedules.
3. Phase law and characterization for the asymmetric family.
The asymmetric ConPD/OBS-F family presents a more challenging problem, as its optimal recursive splits can be unbalanced and vary with the horizon. Despite this complexity, we establish that its asymptotic worst-case performance follows a well-defined, nonconstant phase law, uniformly across large horizons. This demonstrates that the horizon-dependent behavior discovered in the symmetric family persists even under more complicated recursive constructions.
Importantly, our results characterize the leading-order convergence behavior of the optimized asymmetric schedules. We have further strengthened this characterization in the revised manuscript by providing a direct mathematical description of the limiting phase function.
We have revised the manuscript to better explain the significance of our results, clarify the scope of our contributions, and strengthen their presentation and supporting analysis. We thank the reviewer again for the constructive feedback.