We are very excited to join forces with MLCommons and OctoML.ai! Contact Grigori Fursin for more details!

Distributed Statistical Estimation and Rates of Convergence in Normal Approximation

lib:78744d3b6a710fbf (v1.0.0)

Authors: Stanislav Minsker,Nate Strawn
ArXiv: 1704.02658
Document:  PDF  DOI 
Abstract URL: http://arxiv.org/abs/1704.02658v3

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.

Relevant initiatives  

Related knowledge about this paper Reproduced results (crowd-benchmarking and competitions) Artifact and reproducibility checklists Common formats for research projects and shared artifacts Reproducibility initiatives


Please log in to add your comments!
If you notice any inapropriate content that should not be here, please report us as soon as possible and we will try to remove it within 48 hours!