{"total":57,"rows":[{"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":"2303.07160","title":"Tighter Lower Bounds for Shuffling SGD: Random Permutations and Beyond","created":"2023-03-13","cited_by_count":22,"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":"2202.13361","title":"Benign Underfitting of Stochastic Gradient Descent","created":"2022-02-27","cited_by_count":19,"area":null},{"id":"2106.09082","title":"Zeroth-Order Methods for Convex-Concave Minmax Problems: Applications to Decision-Dependent Risk Minimization","created":"2021-06-16","cited_by_count":18,"area":null},{"id":"2206.07021","title":"Federated Optimization Algorithms with Random Reshuffling and Gradient Compression","created":"2022-06-14","cited_by_count":18,"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":"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":"2211.00188","title":"Adaptive Compression for Communication-Efficient Distributed Training","created":"2022-10-31","cited_by_count":16,"area":null},{"id":"2104.12112","title":"Improved Analysis and Rates for Variance Reduction under Without-replacement Sampling Orders","created":"2021-04-25","cited_by_count":13,"area":null},{"id":"2205.03914","title":"Federated Random Reshuffling with Compression and Variance Reduction","created":"2022-05-08","cited_by_count":12,"area":null},{"id":"2504.04579","title":"From Continual Learning to SGD and Back: Better Rates for Continual Linear Models","created":"2025-04-06","cited_by_count":12,"area":null},{"id":"2507.11274","title":"Fast Last-Iterate Convergence of SGD in the Smooth Interpolation Regime","created":"2025-07-15","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":"2103.07079","title":"Can Single-Shuffle SGD be Better than Reshuffling SGD and GD?","created":"2021-03-12","cited_by_count":8,"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":"2305.19259","title":"On Convergence of Incremental Gradient for Non-Convex Smooth Functions","created":"2023-05-30","cited_by_count":7,"area":null},{"id":"2502.12063","title":"Low-Rank Thinning","created":"2025-02-17","cited_by_count":7,"area":null},{"id":"2606.29554","title":"Optimizer Memory Makes Shuffle Order a First-Order Source of Fine-Tuning Noise","created":"2026-06-28","cited_by_count":7,"area":null},{"id":"2209.07446","title":"Efficiency Ordering of Stochastic Gradient Descent","created":"2022-09-15","cited_by_count":6,"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":"2405.19463","title":"Stochastic Optimization Algorithms for Instrumental Variable Regression with Streaming Data","created":"2024-05-29","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":"2412.17723","title":"Asynchronous Federated Learning: A Scalable Approach for Decentralized Machine Learning","created":"2024-12-23","cited_by_count":3,"area":null},{"id":"2505.08306","title":"Rapid Overfitting of Multi-Pass Stochastic Gradient Descent in Stochastic Convex Optimization","created":"2025-05-13","cited_by_count":3,"area":null},{"id":"2206.05830","title":"Stochastic Gradient Descent without Full Data Shuffle","created":"2022-06-12","cited_by_count":2,"area":null},{"id":"2210.12235","title":"Sequential Gradient Descent and Quasi-Newton's Method for Change-Point Analysis","created":"2022-10-21","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":"2601.16563","title":"Process-Tensor Tomography of SGD: Measuring Non-Markovian Memory via Back-Flow of Distinguishability","created":"2026-01-23","cited_by_count":2,"area":null},{"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":"2206.00632","title":"Computing the Variance of Shuffling Stochastic Gradient Algorithms via Power Spectral Density Analysis","created":"2022-06-01","cited_by_count":1,"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":"2503.02269","title":"Experience Replay with Random Reshuffling","created":"2025-03-04","cited_by_count":1,"area":"deeprl"},{"id":"2604.10373","title":"Shuffling the Data, Stretching the Step-size: Sharper Bias in constant step-size SGD","created":"2026-04-11","cited_by_count":1,"area":null},{"id":"2605.02853","title":"Trust, but Verify: Peeling Low-Bit Transformer Networks for Training Monitoring","created":"2026-05-04","cited_by_count":1,"area":null},{"id":"2607.22620","title":"A Resolution of the SS--RS--GD Inequalities","created":"2026-06-16","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":"2406.07712","title":"Loss Gradient Gaussian Width based Generalization and Optimization Guarantees","created":"2024-06-11","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.22488","title":"Proto-EVFL: Enhanced Vertical Federated Learning via Dual Prototype with Extremely Unaligned Data","created":"2025-07-30","cited_by_count":0,"area":null},{"id":"2509.04133","title":"Shuffling Heuristic in Variational Inequalities: Establishing New Convergence Guarantees","created":"2025-09-04","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":"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}