Statistical Limits and Efficient Algorithms for Differentially Private Federated Learning
Arnab Auddy, Xiangni Peng, Subhadeep Paul

TL;DR
This paper introduces new algorithms for differentially private federated learning, balancing estimation accuracy, privacy, and communication efficiency, with theoretical bounds and empirical validation.
Contribution
It proposes FedHybrid and FedNewton algorithms that improve accuracy and reduce communication costs in DP federated learning, with theoretical analysis and practical experiments.
Findings
FedNewton achieves accuracy comparable to FedSGD with fewer communication rounds.
FedHybrid improves accuracy with reduced communication by combining FedSGD and FedAvg.
Theoretical bounds establish the optimality gap for private federated estimators.
Abstract
Federated Learning is a leading framework for training ML and AI models collaboratively across numerous user devices or databases. We study the trade-offs among estimation accuracy, privacy constraints, and communication cost for differentially private (DP) federated M estimation. The two standard methods in the literature are FedAvg, which may suffer from high federation bias, and FedSGD, which can incur high communication cost. Aimed at improving accuracy at a reduced communication cost, we propose FedHybrid, which uses FedSGD starting with an improved initialization by the FedAvg estimator. We propose FedNewton, which averages local Newton iterations to reduce bias in FedAvg, achieving an estimation accuracy comparable to FedSGD with much fewer communication rounds when the number of clients grows sufficiently slowly. We establish finite sample upper bounds on the mean-squared error…
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.
