mlsanityData to 7 Oct 2026

Accelerated Stochastic ExtraGradient: Mixing Hessian and Gradient Similarity to Reduce Communication in Distributed and Federated Learning

arXiv 2409.14280 ↗First posted 22 Sep 2024math.OC cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

Modern realities and trends in learning require more and more generalization ability of models, which leads to an increase in both models and training sample size. It is already difficult to solve such tasks in a single device mode. This is the reason why distributed and federated learning approaches are becoming more popular every day. Distributed computing involves communication between devices, which requires solving two key problems: efficiency and privacy. One of the most well-known approaches to combat communication costs is to exploit the similarity of local data. Both Hessian similarity and homogeneous gradients have been studied in the literature, but separately. In this paper, we combine both of these assumptions in analyzing a new method that incorporates the ideas of using data similarity and clients sampling. Moreover, to address privacy concerns, we apply the technique of additional noise and analyze its impact on the convergence of the proposed method. The theory is confirmed by training on real datasets.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 31 of its 45 references that are in the map. First posted on arXiv 22 Sep 2024.

Builds on

31 of 45 references.

References · 31

  1. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
  2. 2016Deep Learning with Differential Privacycited by 2,682
  3. 2014SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectivescited by 401
  4. 2020A Unified Theory of Decentralized SGD with Changing Topology and Local Updatescited by 361
  5. 2019Tighter Theory for Local SGD on Identical and Heterogeneous Datacited by 266
  6. 2017SARAH: A Novel Method for Machine Learning Problems Using Stochastic Recursive Gradientcited by 218
  7. 2019A Survey on Distributed Machine Learningcited by 187
  8. 2020Minibatch vs Local SGD for Heterogeneous Distributed Learningcited by 147
  9. 2020On Biased Compression for Distributed Learningcited by 140
  10. 2016Katyusha: The First Direct Acceleration of Stochastic Gradient Methodscited by 134
  11. 2013Communication Efficient Distributed Optimization using an Approximate Newton-type Methodcited by 131
  12. 2020PAGE: A Simple and Optimal Probabilistic Gradient Estimator for Nonconvex Optimizationcited by 116
19 more
  1. 2020Local SGD: Unified Theory and New Efficient Methodscited by 88
  2. 2019A Unified Theory of SGD: Variance Reduction, Sampling, Quantization and Coordinate Descentcited by 84
  3. 2019Unified Optimal Analysis of the (Stochastic) Gradient Methodcited by 81
  4. 2019Don't Jump Through Hoops and Remove Those Loops: SVRG and Katyusha are Better Without the Outer Loopcited by 68
  5. 2015Communication Complexity of Distributed Convex Learning and Optimizationcited by 59
  6. 2015A Universal Catalyst for First-Order Optimizationcited by 54
  7. 2020Statistically Preconditioned Accelerated Gradient Method for Distributed Optimizationcited by 29
  8. 2021Decentralized Local Stochastic Extra-Gradient for Variational Inequalitiescited by 25
  9. 2019On Convergence of Distributed Approximate Newton Methods: Globalization, Sharper Bounds and Beyondcited by 18
  10. 2022Faster federated optimization under second-order similaritycited by 18
  11. 2021Acceleration in Distributed Optimization under Similaritycited by 17
  12. 2014Distributed Robust Learningcited by 13
  13. 2023Stochastic Distributed Optimization under Average Second-order Similarity: Algorithms and Analysiscited by 11
  14. 2015Differentially Private Distributed Convex Optimization via Functional Perturbationcited by 10
  15. 2021A Decentralized Adaptive Momentum Method for Solving a Class of Min-Max Optimization Problemscited by 9
  16. 2021Distributed Saddle-Point Problems Under Similaritycited by 8
  17. 2022Compression and Data Similarity: Combination of Two Techniques for Communication-Efficient Solving of Distributed Variational Inequalitiescited by 8
  18. 2023Similarity, Compression and Local Steps: Three Pillars of Efficient Communications for Distributed Variational Inequalitiescited by 7
  19. 2022Differential Privacy Made Easycited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 2.

2 papers.