mlsanityData to 7 Oct 2026

FLeNS: Federated Learning with Enhanced Nesterov-Newton Sketch

arXiv 2409.15216 ↗First posted 23 Sep 2024cs.LG cs.CV cs.DCcited by 0

Not on the map. Why?

Abstract (arXiv)

Federated learning faces a critical challenge in balancing communication efficiency with rapid convergence, especially for second-order methods. While Newton-type algorithms achieve linear convergence in communication rounds, transmitting full Hessian matrices is often impractical due to quadratic complexity. We introduce Federated Learning with Enhanced Nesterov-Newton Sketch (FLeNS), a novel method that harnesses both the acceleration capabilities of Nesterov's method and the dimensionality reduction benefits of Hessian sketching. FLeNS approximates the centralized Newton's method without relying on the exact Hessian, significantly reducing communication overhead. By combining Nesterov's acceleration with adaptive Hessian sketching, FLeNS preserves crucial second-order information while preserving the rapid convergence characteristics. Our theoretical analysis, grounded in statistical learning, demonstrates that FLeNS achieves super-linear convergence rates in communication rounds - a notable advancement in federated optimization. We provide rigorous convergence guarantees and characterize tradeoffs between acceleration, sketch size, and convergence speed. Extensive empirical evaluation validates our theoretical findings, showcasing FLeNS's state-of-the-art performance with reduced communication requirements, particularly in privacy-sensitive and edge-computing scenarios. The code is available at https://github.com/sunnyinAI/FLeNS

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 22 of its 35 references that are in the map. First posted on arXiv 23 Sep 2024.

Builds on

22 of 35 references.

References · 22

  1. 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,592
  2. 2018Federated Optimization in Heterogeneous Networkscited by 2,971
  3. 2021Convex optimizationcited by 2,479
  4. 2016Federated Learning: Strategies for Improving Communication Efficiencycited by 1,461
  5. 2019On the Convergence of FedAvg on Non-IID Datacited by 1,220
  6. 2016Optimization Methods for Large-Scale Machine Learningcited by 1,140
  7. 2019Agnostic Federated Learningcited by 451
  8. 2020FedSplit: An algorithmic framework for fast federated optimizationcited by 108
  9. 2015Newton Sketch: A Linear-time Optimization Algorithm with Linear-Quadratic Convergencecited by 72
  10. 2021What Do We Mean by Generalization in Federated Learning?cited by 62
  11. 2021FedNL: Making Newton-Type Methods Applicable to Federated Learningcited by 50
  12. 2021Sharp Bounds for Federated Averaging (Local SGD) and Continuous Perspectivecited by 38
10 more
  1. 2021Newton-LESS: Sparsification without Trade-offs for the Sketched Newton Updatecited by 23
  2. 2022FedNew: A Communication-Efficient and Privacy-Preserving Newton-Type Method for Federated Learningcited by 23
  3. 2018Optimal Convergence for Distributed Learning with Stochastic Gradient Methods and Spectral Algorithmscited by 22
  4. 2020Distributed Newton Can Communicate Less and Resist Byzantine Workerscited by 20
  5. 2021LocalNewton: Reducing Communication Bottleneck for Distributed Learningcited by 15
  6. 2021Adaptive Newton Sketch: Linear-time Optimization with Quadratic Convergence and Effective Hessian Dimensionalitycited by 14
  7. 2021A Non-parametric View of FedAvg and FedProx: Beyond Stationary Pointscited by 13
  8. 2022SHED: A Newton-type algorithm for federated learning based on incremental Hessian eigenvector sharingcited by 11
  9. 2020Effective Dimension Adaptive Sketching Methods for Faster Regularized Least-Squares Optimizationcited by 9
  10. 2024FedNS: A Fast Sketching Newton-Type Algorithm for Federated Learningcited by 3

Built on by

Not cited yet.