Co-occurring keywords · papers mentioning both
Papers
Random Reshuffling Dominates Stochastic Gradient Descent
COLT 2026
A New Random Reshuffling Method for Nonsmooth Nonconvex Finite-sum Optimization
JMLR 2025
Error dynamics of mini-batch gradient descent with random reshuffling for least squares regression
ALT 2025
Methods with Local Steps and Random Reshuffling for Generally Smooth Non-Convex Federated Optimization
ICLR 2025
Demystifying SGD with Doubly Stochastic Gradients
ICML 2024
Don't Compress Gradients in Random Reshuffling: Compress Gradient Differences
NeurIPS 2024
Stochastic Extragradient with Random Reshuffling: Improved Convergence for Variational Inequalities
AISTATS 2024
Random Reshuffling with Variance Reduction: New Analysis and Better Rates
UAI 2023
SGDA with shuffling: faster convergence for nonconvex-PŁ minimax optimization
ICLR 2023
A General Analysis of Example-Selection for Stochastic Gradient Descent
ICLR 2022
A Unified Convergence Theorem for Stochastic Optimization Methods
NeurIPS 2022
GraB: Finding Provably Better Data Permutations than Random Reshuffling
NeurIPS 2022
Minibatch vs Local SGD with Shuffling: Tight Convergence Bounds and Beyond
ICLR 2022
Proximal and Federated Random Reshuffling
ICML 2022
Sampling without Replacement Leads to Faster Rates in Finite-Sum Minimax Optimization
NeurIPS 2022
Zeroth-Order Methods for Convex-Concave Min-max Problems: Applications to Decision-Dependent Risk Minimization
AISTATS 2022
How Good is SGD with Random Shuffling?
COLT 2020
Random Reshuffling is Not Always Better
NeurIPS 2020
Random Reshuffling: Simple Analysis with Vast Improvements
NeurIPS 2020
Recht-Re Noncommutative Arithmetic-Geometric Mean Conjecture is False
ICML 2020