Distributed statistical estimation and rates of convergence in normal approximation

From MaRDI portal
Publication:2283576

DOI10.1214/19-EJS1647zbMATH Open1434.62046arXiv1704.02658MaRDI QIDQ2283576FDOQ2283576

Stanislav Minsker

Publication date: 3 January 2020

Published in: Electronic Journal of Statistics (Search for Journal in Brave)

Abstract: 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.


Full work available at URL: https://arxiv.org/abs/1704.02658





Cites Work


Cited In (21)






This page was built for publication: Distributed statistical estimation and rates of convergence in normal approximation

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2283576)