Distributed Statistical Estimation and Rates of Convergence in Normal Approximation
Not on the map. Why?
Abstract (arXiv)
This paper presents a class of new algorithms for distributed statistical estimation that exploit divide-and-conquer approach. We show that one of the key benefits of the divide-and-conquer strategy is robustness, an important characteristic for large distributed systems. We establish connections between performance of these distributed algorithms and the rates of convergence in normal approximation, and prove non-asymptotic deviations guarantees, as well as limit theorems, for the resulting estimators. Our techniques are illustrated through several examples: in particular, we obtain new results for the median-of-means estimator, as well as provide performance guarantees for distributed maximum likelihood estimation.
Key facts. Cited by 15 papers in the map (data through 14 Oct 2026). First posted on arXiv 9 Apr 2017.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 3; 2023: 2; 2024: 2; 2025: 4; 2026: 1.
15 papers.
Sort:
- 2022Decentralized Federated Learning: Fundamentals, State of the Art, Frameworks, Trends, and Challengescited by 138
- 2021Variance Reduced Median-of-Means Estimator for Byzantine-Robust Distributed Inferencecited by 11
- 2022Bandits Corrupted by Nature: Lower Bounds on Regret and Robust Optimistic Algorithmcited by 6
- 2023Machine Learning and the Future of Bayesian Computationcited by 4
- 2023Optimality in Mean Estimation: Beyond Worst-Case, Beyond Sub-Gaussian, and Beyond 1+α Momentscited by 4
- 2021Distributed Sparse Normal Means Estimation with Sublinear Communicationcited by 3
- 2025Robust Score Matchingcited by 2
- 2022Collaborative Learning of Discrete Distributions under Heterogeneity and Communication Constraintscited by 1
- 2024Byzantine-tolerant distributed learning of finite mixture modelscited by 1
- 2021Divide-and-conquer methods for big data analysiscited by 0
- 2024Classical Shadows with Improved Median-of-Means Estimationcited by 0
- 2025Learning Centre Partitions from Summariescited by 0
- 2026HOMER: Huber-of-Means for Efficient and Robust Estimation in Hilbert Spaces29 Jul 2026
- 2025Robust Variational Bayes by Min-Max Median Aggregation14 Dec 2025
- 2025On the Optimality of the Median-of-Means Estimator under Adversarial Contamination9 Oct 2025
- 2025Learning Centre Partitions from Summaries19 Sep 2025
- 2025Robust Score Matching9 Jan 2025
- 2024Classical Shadows with Improved Median-of-Means Estimation4 Dec 2024
- 2024Byzantine-tolerant distributed learning of finite mixture models19 Jul 2024
- 2023Optimality in Mean Estimation: Beyond Worst-Case, Beyond Sub-Gaussian, and Beyond 1+α Moments21 Nov 2023
- 2023Machine Learning and the Future of Bayesian Computation21 Apr 2023
- 2022Decentralized Federated Learning: Fundamentals, State of the Art, Frameworks, Trends, and Challenges15 Nov 2022
- 2022Collaborative Learning of Discrete Distributions under Heterogeneity and Communication Constraints1 Jun 2022
- 2022Bandits Corrupted by Nature: Lower Bounds on Regret and Robust Optimistic Algorithm7 Mar 2022
- 2022Decentralized Federated Learning: Fundamentals, State of the Art, Frameworks, Trends, and Challengescited by 138
- 2021Variance Reduced Median-of-Means Estimator for Byzantine-Robust Distributed Inferencecited by 11
- 2022Bandits Corrupted by Nature: Lower Bounds on Regret and Robust Optimistic Algorithmcited by 6
- 2023Machine Learning and the Future of Bayesian Computationcited by 4
- 2023Optimality in Mean Estimation: Beyond Worst-Case, Beyond Sub-Gaussian, and Beyond 1+α Momentscited by 4
- 2021Distributed Sparse Normal Means Estimation with Sublinear Communicationcited by 3
- 2025Robust Score Matchingcited by 2
- 2022Collaborative Learning of Discrete Distributions under Heterogeneity and Communication Constraintscited by 1
- 2024Byzantine-tolerant distributed learning of finite mixture modelscited by 1
- 2021Divide-and-conquer methods for big data analysiscited by 0
- 2024Classical Shadows with Improved Median-of-Means Estimationcited by 0
- 2025Learning Centre Partitions from Summariescited by 0
12 most cited of 15 All 15 (JSON)
- 2026HOMER: Huber-of-Means for Efficient and Robust Estimation in Hilbert Spaces29 Jul 2026
- 2025Robust Variational Bayes by Min-Max Median Aggregation14 Dec 2025
- 2025On the Optimality of the Median-of-Means Estimator under Adversarial Contamination9 Oct 2025
- 2025Learning Centre Partitions from Summaries19 Sep 2025
- 2025Robust Score Matching9 Jan 2025
- 2024Classical Shadows with Improved Median-of-Means Estimation4 Dec 2024
- 2024Byzantine-tolerant distributed learning of finite mixture models19 Jul 2024
- 2023Optimality in Mean Estimation: Beyond Worst-Case, Beyond Sub-Gaussian, and Beyond 1+α Moments21 Nov 2023
- 2023Machine Learning and the Future of Bayesian Computation21 Apr 2023
- 2022Decentralized Federated Learning: Fundamentals, State of the Art, Frameworks, Trends, and Challenges15 Nov 2022
- 2022Collaborative Learning of Discrete Distributions under Heterogeneity and Communication Constraints1 Jun 2022
- 2022Bandits Corrupted by Nature: Lower Bounds on Regret and Robust Optimistic Algorithm7 Mar 2022
12 newest of 15 All 15 (JSON)