- Rating
- 1
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper investigates an accelerated stochastic first-order method that adopts restarting and gradient clipping for -smooth, convex stochastic optimization. The underlying randomness is assumed to admit a finite th moment for some . The results match with best known bounds under similar but stronger conditions.
Critical strengths
- The extensions to weaker conditions.
- Seems to have achieved best known bounds.
Critical weaknesses
W1. Several theoretical statements and their proofs are not rigorous or presents what seems to be AI artifacts that have not been carefully audited/verified by human author. Below are a few examples of possible multiple occurrences of similar issues: (a) significant parts of them are in high-level language without explicit math descriptions (e.g., Lemma 16). (b) Statements like "no claim is made that all upper and lower confidence logarithms coincide" is in the statement of Theorem 17. (c) Theorem 17 makes claim on stochastic methods but the proof only verifies deterministic methods.
W2. The synthetic experiment lacks essential reproduction details.
Questions for authors
Can the reviewers provide initial solutions, data generating process, parameters/ways to tuning parameters, and how the baselines are implemented/tuned, etc?