mlsanityData to 7 Oct 2026

Don't Jump Through Hoops and Remove Those Loops: SVRG and Katyusha are Better Without the Outer Loop

arXiv 1901.08689 ↗First posted 24 Jan 2019cs.LG math.OC stat.MLcited by 68

Not on the map. Why?

Abstract (arXiv)

The stochastic variance-reduced gradient method (SVRG) and its accelerated variant (Katyusha) have attracted enormous attention in the machine learning community in the last few years due to their superior theoretical properties and empirical behaviour on training supervised machine learning models via the empirical risk minimization paradigm. A key structural element in both of these methods is the inclusion of an outer loop at the beginning of which a full pass over the training data is made in order to compute the exact gradient, which is then used to construct a variance-reduced estimator of the gradient. In this work we design em loopless variants of both of these methods. In particular, we remove the outer loop and replace its function by a coin flip performed in each iteration designed to trigger, with a small probability, the computation of the gradient. We prove that the new methods enjoy the same superior theoretical convergence properties as the original methods. However, we demonstrate through numerical experiments that our methods have substantially superior practical behavior.

Key facts. Cited by 68 papers in the map (data through 7 Oct 2026). First posted on arXiv 24 Jan 2019.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 15; 2022: 22; 2023: 10; 2024: 12; 2025: 4; 2026: 5.

68 papers.

Sort:

  1. 2021Stochastic Variance Reduction for Variational Inequality Methodscited by 46
  2. 2022Stochastic Gradient Descent-Ascent: Unified Theory and New Efficient Methodscited by 37
  3. 2022SoteriaFL: A Unified Framework for Private Federated Learning with Communication Compressioncited by 34
  4. 2022Variance Reduced ProxSkip: Algorithm, Theory and Application to Federated Learningcited by 33
  5. 2021CANITA: Faster Rates for Distributed Convex Optimization with Communication Compressioncited by 23
  6. 2023Adaptive SGD with Polyak stepsize and Line-search: Robust Convergence and Variance Reductioncited by 23
  7. 2022Can 5th Generation Local Training Methods Support Client Sampling? Yes!cited by 22
  8. 2021Smoothness Matrices Beat Smoothness Constants: Better Communication Compression Techniques for Distributed Optimizationcited by 21
  9. 2021Random Reshuffling with Variance Reduction: New Analysis and Better Ratescited by 19
  10. 2021FedPAGE: A Fast Local Stochastic Gradient Method for Communication-Efficient Federated Learningcited by 19
  11. 2022Faster federated optimization under second-order similaritycited by 18
  12. 2021Near Optimal Stochastic Algorithms for Finite-Sum Unbalanced Convex-Concave Minimax Optimizationcited by 15
38 more
  1. 2022PAGE-PG: A Simple and Loopless Variance-Reduced Policy Gradient Method with Probabilistic Gradient Estimationcited by 15
  2. 2021ADOM: Accelerated Decentralized Optimization Method for Time-Varying Networkscited by 13
  3. 2021SVRG Meets AdaGrad: Painless Variance Reductioncited by 13
  4. 2021MURANA: A Generic Framework for Stochastic Variance-Reduced Optimizationcited by 13
  5. 2022Federated Random Reshuffling with Compression and Variance Reductioncited by 11
  6. 2023Stochastic Distributed Optimization under Average Second-order Similarity: Algorithms and Analysiscited by 11
  7. 2023Knowledge Distillation Performs Partial Variance Reductioncited by 11
  8. 2022Smooth Monotone Stochastic Variational Inequalities and Saddle Point Problems: A Surveycited by 10
  9. 2023Variance Reduced Halpern Iteration for Finite-Sum Monotone Inclusionscited by 10
  10. 2021ANITA: An Optimal Loopless Accelerated Variance-Reduced Gradient Methodcited by 9
  11. 2021IntSGD: Adaptive Floatless Compression of Stochastic Gradientscited by 8
  12. 2022SketchySGD: Reliable Stochastic Optimization via Randomized Curvature Estimatescited by 8
  13. 2021Decentralized Composite Optimization with Compressioncited by 7
  14. 2022Adaptive Learning Rates for Faster Stochastic Gradient Methodscited by 7
  15. 2022Shifted Compression Framework: Generalizations and Improvementscited by 6
  16. 2023Sarah Frank-Wolfe: Methods for Constrained Optimization with Best Rates and Practical Featurescited by 6
  17. 2023Towards a Better Theoretical Understanding of Independent Subnetwork Trainingcited by 6
  18. 2022Simple and Optimal Stochastic Gradient Methods for Nonsmooth Nonconvex Optimizationcited by 5
  19. 2021Practical Schemes for Finding Near-Stationary Points of Convex Finite-Sumscited by 4
  20. 2022Distributed Methods with Absolute Compression and Error Compensationcited by 4
  21. 2024A Unified Theory of Stochastic Proximal Point Methods without Smoothnesscited by 4
  22. 2021Randomized Stochastic Gradient Descent Ascentcited by 3
  23. 2022Decentralized Stochastic Variance Reduced Extragradient Methodcited by 3
  24. 2022Personalized Federated Learning with Multiple Known Clusterscited by 3
  25. 2023Byzantine-Robust Loopless Stochastic Variance-Reduced Gradientcited by 3
  26. 2023Variance reduction techniques for stochastic proximal point algorithmscited by 3
  27. 2024Correlated Quantization for Faster Nonconvex Distributed Optimizationcited by 3
  28. 2024Second-order Information Promotes Mini-Batch Robustness in Variance-Reduced Gradientscited by 3
  29. 2026PPI-SVRG: Unifying Prediction-Powered Inference and Variance Reduction for Semi-Supervised Optimizationcited by 3
  30. 2022Federated Averaging Langevin Dynamics: Toward a unified theory and new algorithmscited by 2
  31. 2023Byzantine-Robust Decentralized Stochastic Optimization with Stochastic Gradient Noise-Independent Learning Errorcited by 2
  32. 2024On the Complexity of Finite-Sum Smooth Optimization under the Polyak-Lojasiewicz Conditioncited by 2
  33. 2024Variance-Reduced Fast Krasnoselkii-Mann Methods for Finite-Sum Root-Finding Problemscited by 2
  34. 2024Accelerated Stochastic ExtraGradient: Mixing Hessian and Gradient Similarity to Reduce Communication in Distributed and Federated Learningcited by 2
  35. 2024Accelerated Methods with Compressed Communications for Distributed Optimization Problems under Data Similaritycited by 2
  36. 2025Variance Reduction Methods Do Not Need to Compute Full Gradients: Improved Efficiency through Shufflingcited by 2
  37. 2026Unbiased and Biased Variance-Reduced Forward-Reflected-Backward Splitting Methods for Stochastic Composite Inclusionscited by 2
  38. 2026Communication-Efficient Gluon in Federated Learningcited by 2

50 most cited of 68 All 68 (JSON)