Differentially Private Federated Learning: Servers Trustworthiness, Estimation, and Statistical Inference
Not on the map. Why?
Abstract (arXiv)
Differentially private federated learning is crucial for maintaining privacy in distributed environments. This paper investigates the challenges of high-dimensional estimation and inference under the constraints of differential privacy. First, we study scenarios involving an untrusted central server, demonstrating the inherent difficulties of accurate estimation in high-dimensional problems. Our findings indicate that the tight minimax rates depends on the high-dimensionality of the data even with sparsity assumptions. Second, we consider a scenario with a trusted central server and introduce a novel federated estimation algorithm tailored for linear regression models. This algorithm effectively handles the slight variations among models distributed across different machines. We also propose methods for statistical inference, including coordinate-wise confidence intervals for individual parameters and strategies for simultaneous inference. Extensive simulation experiments support our theoretical advances, underscoring the efficacy and reliability of our approaches.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 18 of its 46 references that are in the map. First posted on arXiv 25 Apr 2024.
Builds on
18 of 46 references.
References · 18
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
- 2016Federated Learning: Strategies for Improving Communication Efficiencycited by 1,475
- 2017Differentially Private Federated Learning: A Client Level Perspectivecited by 459
- 2018cpSGD: Communication-efficient and differentially-private distributed SGDcited by 158
- 2020LDP-Fed: Federated Learning with Local Differential Privacycited by 132
- 2020Transfer Learning for High-dimensional Linear Regression: Prediction, Estimation, and Minimax Optimalitycited by 90
- 2020Encode, Shuffle, Analyze Privacy Revisited: Formalizations and Empirical Evaluationcited by 39
- 2017Learning Differentially Private Recurrent Language Modelscited by 36
- 2018Geometric Lower Bounds for Distributed Parameter Estimation under Communication Constraintscited by 33
- 2021Private Federated Learning Without a Trusted Server: Optimal Algorithms for Convex Lossescited by 30
- 2020Unified lower bounds for interactive high-dimensional estimation under information constraintscited by 22
- 2018Differentially Private False Discovery Rate Controlcited by 15
6 more
- 2020The Cost of Privacy in Generalized Linear Models: Algorithms and Minimax Lower Boundscited by 15
- 2024Federated Transfer Learning with Differential Privacycited by 9
- 2019Lower Bounds for Learning Distributions under Communication Constraints via Fisher Informationcited by 4
- 2021Distributed Bootstrap for Simultaneous Inference Under High Dimensionalitycited by 4
- 2019The Cost of Privacy: Rates of Convergence for Parameter Estimation with Differential Privacycited by 2
- 2021High-Dimensional Differentially-Private EM Algorithm: Methods and Near-Optimal Statistical Guaranteescited by 2
Built on by
Citing papers per year: 2025: 1; 2026: 1.
2 papers.