{"total":113,"rows":[{"id":"2205.13648","title":"A Unified Analysis of Federated Learning with Arbitrary Client Participation","created":"2022-05-26","cited_by_count":45,"area":null},{"id":"2302.14428","title":"Stochastic Gradient Descent under Markovian Sampling Schemes","created":"2023-02-28","cited_by_count":38,"area":null},{"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":"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":"2208.09900","title":"Provable Adaptivity of Adam under Non-uniform Smoothness","created":"2022-08-21","cited_by_count":30,"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":"2102.07158","title":"Distributed Second Order Methods with Fast Rates and Compressed Communication","created":"2021-02-14","cited_by_count":25,"area":null},{"id":"2201.11066","title":"Server-Side Stepsizes and Sampling Without Replacement Provably Help in Federated Optimization","created":"2022-01-26","cited_by_count":23,"area":null},{"id":"2112.02089","title":"Regularized Newton Method with Global $O(1/k^2)$ Convergence","created":"2021-12-03","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":"2204.13169","title":"FedShuffle: Recipes for Better Use of Local Work in Federated Learning","created":"2022-04-27","cited_by_count":21,"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":"2205.10733","title":"GraB: Finding Provably Better Data Permutations than Random Reshuffling","created":"2022-05-22","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":"2209.02257","title":"Faster federated optimization under second-order similarity","created":"2022-09-06","cited_by_count":18,"area":null},{"id":"2302.01463","title":"Gradient Descent with Linearly Correlated Noise: Theory and Applications to Differential Privacy","created":"2023-02-02","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":"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":"2207.14628","title":"Towards Communication-efficient Vertical Federated Learning Training via Cache-enabled Local Updates","created":"2022-07-29","cited_by_count":15,"area":null},{"id":"2302.03662","title":"Federated Learning with Regularized Client Participation","created":"2023-02-07","cited_by_count":14,"area":null},{"id":"2305.15938","title":"First Order Methods with Markovian Noise: from Acceleration to Variational Inequalities","created":"2023-05-25","cited_by_count":14,"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":"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":"2205.03914","title":"Federated Random Reshuffling with Compression and Variance Reduction","created":"2022-05-08","cited_by_count":12,"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":"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":"2510.19975","title":"Revisiting Zeroth-Order Optimization: Minimum-Variance Two-Point Estimators and Directionally Aligned Perturbations","created":"2025-10-22","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":"2210.06328","title":"Momentum Aggregation for Private Non-convex ERM","created":"2022-10-12","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":"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":"2301.06806","title":"Convergence of First-Order Algorithms for Meta-Learning with Moreau Envelopes","created":"2023-01-17","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":"2406.11110","title":"How Neural Networks Learn the Support is an Implicit Regularization Effect of SGD","created":"2024-06-17","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":"2112.15287","title":"Distributed Random Reshuffling over Networks","created":"2021-12-31","cited_by_count":7,"area":null},{"id":"2302.00845","title":"Coordinating Distributed Example Orders for Provably Accelerated Training","created":"2023-02-02","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":"2209.05148","title":"Personalized Federated Learning with Communication Compression","created":"2022-09-12","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":"2403.09613","title":"Reawakening knowledge: Anticipatory recovery from catastrophic interference via structured training","created":"2024-03-14","cited_by_count":6,"area":null},{"id":"2307.07357","title":"Inverse Optimization for Routing Problems","created":"2023-07-14","cited_by_count":5,"area":null},{"id":"2311.11841","title":"High Probability Guarantees for Random Reshuffling","created":"2023-11-20","cited_by_count":5,"area":null},{"id":"2403.07148","title":"Stochastic Extragradient with Random Reshuffling: Improved Convergence for Variational Inequalities","created":"2024-03-11","cited_by_count":5,"area":null},{"id":"2405.20114","title":"Towards Faster Decentralized Stochastic Optimization with Communication Compression","created":"2024-05-30","cited_by_count":5,"area":null},{"id":"2203.11489","title":"A Note on Target Q-learning For Solving Finite MDPs with A Generative Oracle","created":"2022-03-22","cited_by_count":4,"area":null},{"id":"2301.12677","title":"Distributed Stochastic Optimization under a General Variance Condition","created":"2023-01-30","cited_by_count":4,"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":"2407.20611","title":"The Entrapment Problem in Random Walk Decentralized Learning","created":"2024-07-30","cited_by_count":4,"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":"2504.04274","title":"Randomised Splitting Methods and Stochastic Gradient Descent","created":"2025-04-05","cited_by_count":3,"area":null},{"id":"2603.15576","title":"Unbiased and Biased Variance-Reduced Forward-Reflected-Backward Splitting Methods for Stochastic Composite Inclusions","created":"2026-03-16","cited_by_count":3,"area":null},{"id":"2105.14216","title":"CDMA: A Practical Cross-Device Federated Learning Algorithm for General Minimax Problems","created":"2021-05-29","cited_by_count":2,"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.05830","title":"Stochastic Gradient Descent without Full Data Shuffle","created":"2022-06-12","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":"2402.07052","title":"Understanding the Training Speedup from Sampling with Approximate Losses","created":"2024-02-10","cited_by_count":2,"area":null},{"id":"2403.00853","title":"Parallel Momentum Methods Under Biased Gradient Estimations","created":"2024-02-29","cited_by_count":2,"area":null},{"id":"2501.16055","title":"Random Reshuffling for Stochastic Gradient Langevin Dynamics","created":"2025-01-27","cited_by_count":2,"area":null},{"id":"2502.14648","title":"Variance Reduction Methods Do Not Need to Compute Full Gradients: Improved Efficiency through Shuffling","created":"2025-02-20","cited_by_count":2,"area":null},{"id":"2504.13266","title":"Graph Learning at Scale: Characterizing and Optimizing Pre-Propagation GNNs","created":"2025-04-17","cited_by_count":2,"area":null},{"id":"2510.19953","title":"On the Optimal Construction of Unbiased Gradient Estimators for Zeroth-Order Optimization","created":"2025-10-22","cited_by_count":2,"area":null},{"id":"2601.21624","title":"Training Memory in Deep Neural Networks: Mechanisms, Evidence, and Measurement Gaps","created":"2026-01-29","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":"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":"2512.21521","title":"First Provable Guarantees for Practical Private FL: Beyond Restrictive Assumptions","created":"2025-12-25","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":"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":"2207.08195","title":"SPIRAL: A superlinearly convergent incremental proximal algorithm for nonconvex finite sum minimization","created":"2022-07-17","cited_by_count":0,"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":"2401.07694","title":"Stochastic optimization with arbitrary recurrent data sampling","created":"2024-01-15","cited_by_count":0,"area":null},{"id":"2403.11163","title":"A Selective Review on Statistical Methods for Massive Data Computation: Distributed Computing, Subsampling, and Minibatch Techniques","created":"2024-03-17","cited_by_count":0,"area":null},{"id":"2403.16557","title":"Accelerating Federated Learning by Selecting Beneficial Herd of Local Gradients","created":"2024-03-25","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}],"next_cursor":"100"}