{"total":56,"rows":[{"id":"2102.06704","title":"Proximal and Federated Random Reshuffling","created":"2021-02-12","cited_by_count":33,"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":"2302.04552","title":"Optimistic Online Mirror Descent for Bridging Stochastic and Adversarial Online Convex Optimization","created":"2023-02-09","cited_by_count":22,"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":"2305.15349","title":"On the Convergence of Black-Box Variational Inference","created":"2023-05-24","cited_by_count":22,"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":"2211.00188","title":"Adaptive Compression for Communication-Efficient Distributed Training","created":"2022-10-31","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":"2302.03662","title":"Federated Learning with Regularized Client Participation","created":"2023-02-07","cited_by_count":14,"area":null},{"id":"2102.09645","title":"SVRG Meets AdaGrad: Painless Variance Reduction","created":"2021-02-18","cited_by_count":13,"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":"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":"2203.03159","title":"Risk Bounds of Multi-Pass SGD for Least Squares in the Interpolation Regime","created":"2022-03-07","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":"2306.05862","title":"Lessons from Generalization Error Analysis of Federated Learning: You May Communicate Less Often!","created":"2023-06-09","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":"2103.12293","title":"Stochastic Reweighted Gradient Descent","created":"2021-03-23","cited_by_count":7,"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":"2305.19259","title":"On Convergence of Incremental Gradient for Non-Convex Smooth Functions","created":"2023-05-30","cited_by_count":7,"area":null},{"id":"2401.09339","title":"Central Limit Theorem for Two-Timescale Stochastic Approximation with Markovian Noise: Theory and Applications","created":"2024-01-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":"2310.17761","title":"Distributed Personalized Empirical Risk Minimization","created":"2023-10-26","cited_by_count":6,"area":null},{"id":"2403.09613","title":"Reawakening knowledge: Anticipatory recovery from catastrophic interference via structured training","created":"2024-03-14","cited_by_count":6,"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":"2312.02368","title":"RINAS: Training with Dataset Shuffling Can Be General and Fast","created":"2023-12-04","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":"2111.03820","title":"Distributed stochastic proximal algorithm with random reshuffling for non-smooth finite-sum optimization","created":"2021-11-06","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":"2310.15976","title":"Convergence of Sign-based Random Reshuffling Algorithms for Nonconvex Optimization","created":"2023-10-24","cited_by_count":2,"area":null},{"id":"2409.17499","title":"Does Worst-Performing Agent Lead the Pack? Analyzing Agent Dynamics in Unified Distributed SGD","created":"2024-09-26","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":"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":"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":"2607.22620","title":"A Resolution of the SS--RS--GD Inequalities","created":"2026-06-16","cited_by_count":1,"area":null},{"id":"2609.08133","title":"Sparse Data Augmentation for Optimization with Provable Guarantees","created":"2026-09-08","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":"2304.10123","title":"Linear Convergence of Reshuffling Kaczmarz Methods With Sparse Constraints","created":"2023-04-20","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":"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":"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}