- Rating
- 1
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 3
Read review
Paper summary
The authors study convex optimization under generalized smoothness and light-tailed (sub-Gaussian), unbiased stochastic gradients. The authors provide an algorithm based on two phases.
Critical strengths
- The writing is very poor, and reads as if it was mostly AI-written, without much cleanup.
Critical weaknesses
- The writing is very poor, and reads as if it was mostly AI-written, without much cleanup.
- Some of the presentation doesn’t feel that intuitive, e.g. I think the algorithm should be introduced, along with intuition for what the two phases do again before the introduction of Lemmas 1-4. In particular, Lemmas 1-4 seem to be technical results, and should be deferred to after Section 3.
- The paragraph titles are not constructed in a linear fashion (e.g. describing Phase I)
Questions for authors
- I wonder if the paper may be overcomplicating the algorithm for this generalized smoothness setup. Shouldn’t it be possible to use two black-box solvers for the two phases?
I’m not super familiar with optimization under generalized smoothness, so please correct me if I’m wrong.