On the Last-Iterate Convergence of Shuffling Gradient Methods
<|reference_start|>On the Last-Iterate Convergence of Shuffling Gradient Methods: Shuffling gradient methods are widely used in modern machine learning tasks and include three popular implementations: Random Reshuffle (RR), Shuffle Once (SO), and Incremental Gradient (IG). Compared to the empirical success, the theoretical guarantee of shuffling gradient methods was not well-understood for a long time. Until recently, the convergence rates had just been established for the average iterate for convex functions and the last iterate for strongly convex problems (using squared distance as the metric). However, when using the function value gap as the convergence criterion, existing theories cannot interpret the good performance of the last iterate in different settings (e.g., constrained optimization). To bridge this gap between practice and theory, we prove the first last-iterate convergence rates for shuffling gradient methods with respect to the objective value even without strong convexity. Our new results either (nearly) match the existing last-iterate lower bounds or are as fast as the previous best upper bounds for the average iterate.<|reference_end|>
@article{liu2024on,
    title={On the Last-Iterate Convergence of Shuffling Gradient Methods},
    author={Zijian Liu, Zhengyuan Zhou},
    journal={arXiv preprint arXiv:2403.07723},
    year={2024},
    archivePrefix={arXiv},
    eprint={2403.07723},
    primaryClass={cs.LG math.OC stat.ML}
}