Pith. sign in

REVIEW 1 cited by

Fed-Sophia: A Communication-Efficient Second-Order Federated Learning Algorithm

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2406.06655 v1 pith:CL7HSWRB submitted 2024-06-10 cs.LG cs.AIcs.DC

classification cs.LGcs.AIcs.DC
keywords second-ordercurvaturefed-sophiafederatedinformationlearningmethodaddition
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. An Enhanced Levenberg--Marquardt Method via Gram Reduction

    math.OC 2024-12 conditional novelty 6.0 of 10

    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.

Pith tools