Understanding the Impact of Model Incoherence on Convergence of Incremental SGD with Random Reshuffle
Shaocong Ma, Yi Zhou
Abstract
Although SGD with random reshuffle has been widely-used in machine learning applications, there is a limited understanding of how model characteristics affect the convergence of the algorithm. In this work, we introduce model incoherence to characterize the diversity of model characteristics and study its impact on convergence of SGD with random reshuffle under weak strong convexity. Specifically, minimizer incoherence measures the discrepancy between the global minimizers of a sample loss and those of the total loss and affects the convergence error of SGD with random reshuffle. In particular, we show that the variable sequence generated by SGD with random reshuffle converges to a certain global minimizer of the total loss under full minimizer coherence. The other curvature incoherence measures the quality of condition numbers of the sample losses and determines the convergence rate of SGD. With model incoherence, our results show that SGD has a faster convergence rate and smaller convergence error under random reshuffle than those under random sampling, and hence provide justifications to the superior practical performance of SGD with random reshuffle.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 834dab1c-0a03-49e3-b3b2-0dbe7e43e18aCited by top-tier papers3
- On the Optimal Construction of Unbiased Gradient Estimators for Zeroth-Order OptimizationShaocong Ma, Heng HuangNeurIPS 2025 · 4 citations
- New Hybrid Fine-Tuning Paradigm for LLMs: Algorithm Design and Convergence Analysis FrameworkShaocong Ma, Peiran Yu, Heng HuangICLR 2026 · 1 citation
- An Improved Analysis and Rates for Variance Reduction under Without-replacement Sampling OrdersXinmeng Huang, Kun Yuan, Xianghui Mao, Wotao YinNeurIPS 2021 · 1 citation
Related papers
- Random Reshuffling: Simple Analysis with Vast ImprovementsKonstantin Mishchenko, Ahmed Khaled, Peter RichtárikNeurIPS 2020 · 172 citations
- Revisiting Convergence: Shuffling Complexity Beyond Lipschitz SmoothnessQi He, Peiran Yu, Ziyi Chen, Heng HuangICML 2025
- On the Training Instability of Shuffling SGD with Batch NormalizationDavid Xing Wu, Chulhee Yun, Suvrit SraICML 2023 · 6 citations
- On the Last-Iterate Convergence of Shuffling Gradient MethodsZijian Liu, Zhengyuan ZhouICML 2024 · 11 citations
- SGD with shuffling: optimal rates without component convexity and large epoch requirementsKwangjun Ahn, Chulhee Yun, Suvrit SraNeurIPS 2020 · 83 citations
