Robust Federated Personalised Mean Estimation for the Gaussian Mixture Model
Not on the map. Why?
Abstract (arXiv)
Federated learning with heterogeneous data and personalization has received significant recent attention. Separately, robustness to corrupted data in the context of federated learning has also been studied. In this paper we explore combining personalization for heterogeneous data with robustness, where a constant fraction of the clients are corrupted. Motivated by this broad problem, we formulate a simple instantiation which captures some of its difficulty. We focus on the specific problem of personalized mean estimation where the data is drawn from a Gaussian mixture model. We give an algorithm whose error depends almost linearly on the ratio of corrupted to uncorrupted samples, and show a lower bound with the same behavior, albeit with a gap of a constant factor.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 10 of its 18 references that are in the map. First posted on arXiv 28 Apr 2025.
Builds on
10 of 18 references.
References · 10
- 2016Communication-Efficient Learning of Deep Networks from Decentralized Datacited by 7,669
- 2019Advances and Open Problems in Federated Learningcited by 3,046
- 2016Robust Estimators in High Dimensions without the Computational Intractabilitycited by 209
- 2016Agnostic Estimation of Mean and Covariancecited by 131
- 2016Learning from Untrusted Datacited by 90
- 2019Robust Federated Learning in a Heterogeneous Environmentcited by 90
- 2020Byzantine-Resilient High-Dimensional Federated Learningcited by 27
- 2017Learning Discrete Distributions from Untrusted Batchescited by 14
- 2019Optimal Robust Learning of Discrete Distributions from Batchescited by 10
- 2020Learning Structured Distributions From Untrusted Batches: Faster and Simplercited by 8
Built on by
Citing papers per year: 2026: 1.
1 paper.