Reusing the Gram matrix for m iterations in a Levenberg-Marquardt method yields global convergence with O(d^3/epsilon + d^2/epsilon^2) total cost and local superlinear rate.
Fed-Sophia: A Communication-Efficient Second-Order Federated Learning Algorithm
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Federated learning is a machine learning approach where multiple devices collaboratively learn with the help of a parameter server by sharing only their local updates. While gradient-based optimization techniques are widely adopted in this domain, the curvature information that second-order methods exhibit is crucial to guide and speed up the convergence. This paper introduces a scalable second-order method, allowing the adoption of curvature information in federated large models. Our method, coined Fed-Sophia, combines a weighted moving average of the gradient with a clipping operation to find the descent direction. In addition to that, a lightweight estimation of the Hessian's diagonal is used to incorporate the curvature information. Numerical evaluation shows the superiority, robustness, and scalability of the proposed Fed-Sophia scheme compared to first and second-order baselines.
citation-role summary
citation-polarity summary
fields
math.OC 1years
2024 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
An Enhanced Levenberg--Marquardt Method via Gram Reduction
Reusing the Gram matrix for m iterations in a Levenberg-Marquardt method yields global convergence with O(d^3/epsilon + d^2/epsilon^2) total cost and local superlinear rate.