Shuffling gradient methods converge without Lipschitz smoothness under a sub-quadratic ℓ-smoothness condition, matching Lipschitz-case rates when ℓ is constant.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Revisiting Convergence: Shuffling Complexity Beyond Lipschitz Smoothness
Shuffling gradient methods converge without Lipschitz smoothness under a sub-quadratic ℓ-smoothness condition, matching Lipschitz-case rates when ℓ is constant.