- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
The paper proposes a family of geometry-accelerated Bregman proximal gradient methods for convex, relatively strongly convex, and nonconvex composite optimization. The methods combine proximal updates with auxiliary mirror updates and computable backtracking or reset criteria. The analysis establishes parameter-dependent accelerated bounds for convex problems and a stationarity-residual bound for nonconvex problems, with additional parameter-boundedness guarantees for Burg geometry. Experiments evaluate the methods on several inverse and learning problems.
Critical strengths
The framework accommodates distinct proximal and auxiliary geometries, providing flexibility in constructing tractable updates. The analysis addresses domain feasibility, finite termination of the inner searches, and convergence guarantees across three optimization regimes. The Burg parameter-boundedness argument has technical value beyond merely assuming bounded parameters. The experiments include established Bregman baselines and report both iteration counts and wall-clock time, demonstrating improvements on the tested instances.
Critical weaknesses
-
Limited novelty relative to ABPG-g. ABPG-g already combines adaptive gains with conditional accelerated guarantees. GA-BPG changes the proximal center, auxiliary updates, and acceptance tests, but the manuscript does not clearly establish a substantial conceptual advance or a distinct theoretical advantage. In particular, the Burg parameter-boundedness result requires a direct comparison with guarantees obtainable for ABPG-g under comparable assumptions.
-
Insufficient experimental attribution and baseline transparency. Missing ablations prevent separating the effects of the update structure, auxiliary geometry, and parameter adaptation. Moreover, ABPG-g’s exponent, relative-smoothness constant, gain parameters, stopping thresholds, and tuning budget are not adequately specified. The reported speedups therefore cannot be confidently attributed to the proposed mechanism rather than parameter choices or favorable problem geometry.
Questions for authors
-
What is the clearest theoretical advantage over ABPG-g under comparable assumptions?
-
Can the authors provide the missing ablations and complete baseline configurations?
3 comments
Thank you for the reply. I raised my score.
Thank you for taking the time to review our responses. We appreciate your thoughtful feedback and constructive discussion.
Thank you for these constructive comments, which prompted us to strengthen the analysis and add additional experiments.
(W1), (Q1) Limited novelty relative to ABPG-g. What is the clearest theoretical advantage over ABPG-g under comparable assumptions?
We have clarified the methodological distinction in Section 2 and the theoretical contributions in Section 3. The theoretical advantage over ABPG-g is that we establish explicit conditions guaranteeing convergence for a broader class of problems, as detailed below.
(W2), (Q2) Insufficient experimental attribution and baseline transparency. Can the authors provide the missing ablations and complete baseline configurations?
We added experiments varying the auxiliary geometry and the stepsize rule; see Figure 4 in Appendix F.1. Their relationship to the new sufficient conditions is discussed in Appendix F.2. On NYTimes, KL auxiliary geometry performs best under both stepsize rules. With this geometry, stepsize adaptation yields approximately a twofold reduction in time to a normalized gap of 10−4 compared with fixed λ=1/L.
We also clarified the ABPG-g implementation and parameter-setting policy in the opening paragraph of Section 4. This paragraph describes the use of the authors'
accbpgimplementation and its linesearch settings, problem-specific relative-smoothness constants, and the initial-gain choice to match the first trial proximal stepsize of the corresponding GA-BPG method.