FLeNS: Federated Learning with Enhanced Nesterov-Newton Sketch
Sunny Gupta, Mohit Jindal, Pankhi Kashyap, Pranav Jeevan, Amit Sethi

TL;DR
FLeNS introduces a federated learning algorithm that combines Nesterov acceleration with Hessian sketching to achieve super-linear convergence while significantly reducing communication costs.
Contribution
It presents a novel federated optimization method that approximates second-order Newton updates efficiently using Hessian sketching combined with Nesterov's acceleration.
Findings
Achieves super-linear convergence in communication rounds.
Reduces communication overhead via Hessian sketching.
Outperforms existing methods in empirical evaluations.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsPrivacy-Preserving Technologies in Data
