mlsanityData to 14 Oct 2026

Distributed Statistical Estimation and Rates of Convergence in Normal Approximation

arXiv 1704.02658 ↗First posted 9 Apr 2017math.ST cs.DC stat.MLcited by 15

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

Cited by year (2026 to 14 Oct)

Citing papers per year: 2021: 3; 2022: 3; 2023: 2; 2024: 2; 2025: 4; 2026: 1.

15 papers.

Sort: