{"total":79,"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":"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":"2106.09857","title":"Effective Model Sparsification by Scheduled Grow-and-Prune Methods","created":"2021-06-18","cited_by_count":26,"area":null},{"id":"2106.04881","title":"Fractal Structure and Generalization Properties of Stochastic Optimization Algorithms","created":"2021-06-09","cited_by_count":23,"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":"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":"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":"2404.00498","title":"94% on CIFAR-10 in 3.29 Seconds on a Single GPU","created":"2024-03-30","cited_by_count":16,"area":null},{"id":"2101.08734","title":"Clairvoyant Prefetching for Distributed Machine Learning I/O","created":"2021-01-21","cited_by_count":14,"area":null},{"id":"2102.05242","title":"Patterns, predictions, and actions: A story about machine learning","created":"2021-02-10","cited_by_count":14,"area":null},{"id":"2302.03662","title":"Federated Learning with Regularized Client Participation","created":"2023-02-07","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":"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":"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":"2311.14056","title":"DPSUR: Accelerating Differentially Private Stochastic Gradient Descent Using Selective Update and Release","created":"2023-11-23","cited_by_count":10,"area":"safety"},{"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":"2307.05906","title":"Mini-Batch Optimization of Contrastive Loss","created":"2023-07-12","cited_by_count":8,"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":"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":"2308.16403","title":"Balancing between the Local and Global Structures (LGS) in Graph Embedding","created":"2023-08-31","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":"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":"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.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":"2504.18082","title":"Efficient GNN Training Through Structure-Aware Randomized Mini-Batching","created":"2025-04-25","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":"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":"2411.05868","title":"Provably Faster Algorithms for Bilevel Optimization via Without-Replacement Sampling","created":"2024-11-07","cited_by_count":1,"area":null},{"id":"2411.07102","title":"Effectively Leveraging Momentum Terms in Stochastic Line Search Frameworks for Fast Optimization of Finite-Sum Problems","created":"2024-11-11","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":"2509.13628","title":"Accelerated Gradient Methods with Biased Gradient Estimates: Risk Sensitivity, High-Probability Guarantees, and Large Deviation Bounds","created":"2025-09-17","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":"2101.01178","title":"Advances in Electron Microscopy with Deep Learning","created":"2021-01-04","cited_by_count":0,"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":"2309.01640","title":"Corgi^2: A Hybrid Offline-Online Approach To Storage-Aware Data Shuffling For SGD","created":"2023-09-04","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":"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":"2507.08913","title":"Revisiting Convergence: Shuffling Complexity Beyond Lipschitz Smoothness","created":"2025-07-11","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":"2604.09940","title":"New Hybrid Fine-Tuning Paradigm for LLMs: Algorithm Design and Convergence Analysis Framework","created":"2026-04-10","cited_by_count":0,"area":null},{"id":"2605.22644","title":"Why SGD is not Brownian Motion: A New Perspective on Stochastic Dynamics","created":"2026-05-21","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":"2609.25735","title":"Beyond Class Marginals: Bounding Rehearsal Gaps without Freezing Class Co-occurrence","created":"2026-09-22","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}