The reviewed record of science sign in
Pith

arxiv: 2410.08760 · v2 · pith:ZNMGBZ33 · submitted 2024-10-11 · cs.LG · cs.AI· cs.MS· cs.PF· math.OC

Unlocking FedNL: Self-Contained Compute-Optimized Implementation

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:ZNMGBZ33record.jsonopen to challenge →

classification cs.LG cs.AIcs.MScs.PFmath.OC
keywords fednlarxivmulti-nodeprototypefederatedimplementationlearningself-contained
0
0 comments X
read the original abstract

Federated Learning (FL) is an emerging paradigm that enables intelligent agents to collaboratively train Machine Learning (ML) models in a distributed manner, eliminating the need for sharing their local data. The recent work (arXiv:2106.02969) introduces a family of Federated Newton Learn (FedNL) algorithms, marking a significant step towards applying second-order methods to FL and large-scale optimization. However, the reference FedNL prototype exhibits three serious practical drawbacks: (i) It requires 4.8 hours to launch a single experiment in a sever-grade workstation; (ii) The prototype only simulates multi-node setting; (iii) Prototype integration into resource-constrained applications is challenging. To bridge the gap between theory and practice, we present a self-contained implementation of FedNL, FedNL-LS, FedNL-PP for single-node and multi-node settings. Our work resolves the aforementioned issues and reduces the wall clock time by x1000. With this FedNL outperforms alternatives for training logistic regression in a single-node -- CVXPY (arXiv:1603.00943), and in a multi-node -- Apache Spark (arXiv:1505.06807), Ray/Scikit-Learn (arXiv:1712.05889). Finally, we propose two practical-orientated compressors for FedNL - adaptive TopLEK and cache-aware RandSeqK, which fulfill the theory of FedNL.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.