{"total":58,"rows":[{"id":"2110.10342","title":"Minibatch vs Local SGD with Shuffling: Tight Convergence Bounds and Beyond","created":"2021-10-20","cited_by_count":36,"area":null},{"id":"2302.03109","title":"On the Convergence of Federated Averaging with Cyclic Client Participation","created":"2023-02-06","cited_by_count":31,"area":null},{"id":"2307.04138","title":"On The Impact of Machine Learning Randomness on Group Fairness","created":"2023-07-09","cited_by_count":26,"area":null},{"id":"2104.09342","title":"Random Reshuffling with Variance Reduction: New Analysis and Better Rates","created":"2021-04-19","cited_by_count":19,"area":null},{"id":"2104.13326","title":"Fast Distributionally Robust Learning with Variance Reduced Min-Max Optimization","created":"2021-04-27","cited_by_count":19,"area":null},{"id":"2102.09718","title":"Permutation-Based SGD: Is Random Optimal?","created":"2021-02-19","cited_by_count":17,"area":null},{"id":"2106.06880","title":"Random Shuffling Beats SGD Only After Many Epochs on Ill-Conditioned Problems","created":"2021-06-12","cited_by_count":17,"area":null},{"id":"2110.04926","title":"Convergence of Random Reshuffling Under The Kurdyka-{\\L}ojasiewicz Inequality","created":"2021-10-10","cited_by_count":16,"area":null},{"id":"2202.01838","title":"Characterizing & Finding Good Data Orderings for Fast Convergence of Sequential Gradient Methods","created":"2022-02-03","cited_by_count":16,"area":null},{"id":"2310.20452","title":"AsGrad: A Sharp Unified Analysis of Asynchronous-SGD Algorithms","created":"2023-10-31","cited_by_count":16,"area":null},{"id":"2307.11782","title":"Convergence of Adam for Non-convex Objectives: Relaxed Hyperparameters and Non-ergodic Case","created":"2023-07-20","cited_by_count":14,"area":null},{"id":"2410.08305","title":"Randomized Asymmetric Chain of LoRA: The First Meaningful Theoretical Framework for Low-Rank Adaptation","created":"2024-10-10","cited_by_count":13,"area":null},{"id":"2206.03907","title":"A Unified Convergence Theorem for Stochastic Optimization Methods","created":"2022-06-08","cited_by_count":12,"area":null},{"id":"2403.07723","title":"On the Last-Iterate Convergence of Shuffling Gradient Methods","created":"2024-03-12","cited_by_count":11,"area":null},{"id":"2202.03525","title":"Nesterov Accelerated Shuffling Gradient Method for Convex Optimization","created":"2022-02-07","cited_by_count":10,"area":null},{"id":"2206.02953","title":"Sampling without Replacement Leads to Faster Rates in Finite-Sum Minimax Optimization","created":"2022-06-07","cited_by_count":10,"area":null},{"id":"2403.06873","title":"Last Iterate Convergence of Incremental Methods and Applications in Continual Learning","created":"2024-03-11","cited_by_count":10,"area":null},{"id":"2106.15207","title":"Optimal Rates for Random Order Online Optimization","created":"2021-06-29","cited_by_count":9,"area":null},{"id":"2210.05995","title":"SGDA with shuffling: faster convergence for nonconvex-P{\\L} minimax optimization","created":"2022-10-12","cited_by_count":8,"area":null},{"id":"2307.05906","title":"Mini-Batch Optimization of Contrastive Loss","created":"2023-07-12","cited_by_count":8,"area":null},{"id":"2111.13322","title":"Random-reshuffled SARAH does not need a full gradient computations","created":"2021-11-26","cited_by_count":7,"area":null},{"id":"2112.15287","title":"Distributed Random Reshuffling over Networks","created":"2021-12-31","cited_by_count":7,"area":null},{"id":"2305.19259","title":"On Convergence of Incremental Gradient for Non-Convex Smooth Functions","created":"2023-05-30","cited_by_count":7,"area":null},{"id":"2306.12498","title":"Empirical Risk Minimization with Shuffled SGD: A Primal-Dual Perspective and Improved Bounds","created":"2023-06-21","cited_by_count":6,"area":null},{"id":"2311.11841","title":"High Probability Guarantees for Random Reshuffling","created":"2023-11-20","cited_by_count":5,"area":null},{"id":"2312.01047","title":"A New Random Reshuffling Method for Nonsmooth Nonconvex Finite-sum Optimization","created":"2023-12-02","cited_by_count":4,"area":null},{"id":"2601.10237","title":"Fundamental Limitations of Favorable Privacy-Utility Guarantees for DP-SGD","created":"2026-01-15","cited_by_count":4,"area":null},{"id":"2302.12444","title":"On the Training Instability of Shuffling SGD with Batch Normalization","created":"2023-02-24","cited_by_count":3,"area":null},{"id":"2312.02368","title":"RINAS: Training with Dataset Shuffling Can Be General and Fast","created":"2023-12-04","cited_by_count":3,"area":null},{"id":"2202.03524","title":"Finite-Sum Optimization: A New Perspective for Convergence to a Global Solution","created":"2022-02-07","cited_by_count":2,"area":null},{"id":"2206.05869","title":"On the Convergence to a Global Solution of Shuffling-Type Gradient Algorithms","created":"2022-06-13","cited_by_count":2,"area":null},{"id":"2306.12037","title":"Distributed Random Reshuffling Methods with Improved Convergence","created":"2023-06-21","cited_by_count":2,"area":null},{"id":"2310.12969","title":"Demystifying the Myths and Legends of Nonconvex Convergence of SGD","created":"2023-10-19","cited_by_count":2,"area":null},{"id":"2310.15976","title":"Convergence of Sign-based Random Reshuffling Algorithms for Nonconvex Optimization","created":"2023-10-24","cited_by_count":2,"area":null},{"id":"2406.00920","title":"Demystifying SGD with Doubly Stochastic Gradients","created":"2024-06-03","cited_by_count":2,"area":"diffusion"},{"id":"2604.00260","title":"Learning to Shuffle: Block Reshuffling and Reversal Schemes for Stochastic Optimization","created":"2026-03-31","cited_by_count":2,"area":null},{"id":"2606.32005","title":"Random Reshuffling Dominates Stochastic Gradient Descent","created":"2026-06-30","cited_by_count":2,"area":null},{"id":"2304.00459","title":"Fast Convergence of Random Reshuffling under Over-Parameterization and the Polyak-\\L ojasiewicz Condition","created":"2023-04-02","cited_by_count":1,"area":null},{"id":"2403.03180","title":"Shuffling Momentum Gradient Algorithm for Convex Optimization","created":"2024-03-05","cited_by_count":1,"area":null},{"id":"2406.05637","title":"A Generalized Version of Chung's Lemma and its Applications","created":"2024-06-09","cited_by_count":1,"area":null},{"id":"2406.14059","title":"Tracking solutions of time-varying variational inequalities","created":"2024-06-20","cited_by_count":1,"area":null},{"id":"2411.05868","title":"Provably Faster Algorithms for Bilevel Optimization via Without-Replacement Sampling","created":"2024-11-07","cited_by_count":1,"area":null},{"id":"2509.10161","title":"FedBiF: Communication-Efficient Federated Learning via Bits Freezing","created":"2025-09-12","cited_by_count":1,"area":null},{"id":"2601.01248","title":"Stochastic Control Methods for Optimization","created":"2026-01-03","cited_by_count":1,"area":null},{"id":"2603.05960","title":"Omni-Masked Gradient Descent: Memory-Efficient Optimization via Mask Traversal with Improved Convergence","created":"2026-03-06","cited_by_count":1,"area":null},{"id":"2603.16042","title":"Shuffling the Stochastic Mirror Descent via Dual Lipschitz Continuity and Kernel Conditioning","created":"2026-03-17","cited_by_count":1,"area":null},{"id":"2212.01848","title":"Convergence of ease-controlled Random Reshuffling gradient Algorithms under Lipschitz smoothness","created":"2022-12-04","cited_by_count":0,"area":null},{"id":"2306.15848","title":"Ordering for Non-Replacement SGD","created":"2023-06-28","cited_by_count":0,"area":null},{"id":"2406.03696","title":"Error dynamics of mini-batch gradient descent with random reshuffling for least squares regression","created":"2024-06-06","cited_by_count":0,"area":null},{"id":"2409.12296","title":"JKO for Landau: a variational particle method for homogeneous Landau equation","created":"2024-09-18","cited_by_count":0,"area":null},{"id":"2410.22297","title":"Shuffling Gradient-Based Methods for Nonconvex-Concave Minimax Optimization","created":"2024-10-29","cited_by_count":0,"area":null},{"id":"2506.12444","title":"Adjusted Shuffling SARAH: Advancing Complexity Analysis via Dynamic Gradient Weighting","created":"2025-06-14","cited_by_count":0,"area":null},{"id":"2507.08913","title":"Revisiting Convergence: Shuffling Complexity Beyond Lipschitz Smoothness","created":"2025-07-11","cited_by_count":0,"area":null},{"id":"2512.04703","title":"Towards Continuous-Time Approximations for Stochastic Gradient Descent without Replacement","created":"2025-12-04","cited_by_count":0,"area":null},{"id":"2605.28513","title":"Learning Theory of the SVRG: Generalization and Convergence Analysis","created":"2026-05-27","cited_by_count":0,"area":null},{"id":"2608.03001","title":"Stochastic Saddle Avoidance Beyond Unit Excitation and Smoothness: A Pathwise Lyapunov-Perron Framework","created":"2026-08-04","cited_by_count":0,"area":null},{"id":"2609.04578","title":"Centered Permutation Prefixes for SGD with Random Reshuffling: Sharp Rates, H\\\"older Geometry, and Composite Proximal Extensions","created":"2026-09-04","cited_by_count":0,"area":null},{"id":"2610.19444","title":"Large-Step Last-Iterate Convergence of Random-Reshuffling Stochastic Gradient Descent","created":"2026-10-14","cited_by_count":0,"area":null}],"next_cursor":null}