The reviewed record of science sign in
Pith

arxiv: 2408.04315 · v2 · pith:2XBXRYBN · submitted 2024-08-08 · cs.LG · cs.SY· eess.SY

Federated Cubic Regularized Newton Learning with Sparsification-amplified Differential Privacy

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

classification cs.LG cs.SYeess.SY
keywords privacyfederatedalgorithmlearningnewtoncommunicationcubicguarantee
0
0 comments X
read the original abstract

This paper investigates the use of the cubic-regularized Newton method within a federated learning framework while addressing two major concerns that commonly arise in federated learning: privacy leakage and communication bottleneck. We introduce a federated learning algorithm called Differentially Private Federated Cubic Regularized Newton (DP-FCRN). By leveraging second-order techniques, our algorithm achieves lower iteration complexity compared to first-order methods. We also incorporate noise perturbation during local computations to ensure privacy. Furthermore, we employ sparsification in uplink transmission, which not only reduces the communication costs but also amplifies the privacy guarantee. Specifically, this approach reduces the necessary noise intensity without compromising privacy protection. We analyze the convergence properties of our algorithm and establish the privacy guarantee. Finally, we validate the effectiveness of the proposed algorithm through experiments on a benchmark dataset.

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.