A Distributed One-Step Estimator
Not on the map. Why?
Abstract (arXiv)
Distributed statistical inference has recently attracted enormous attention. Many existing work focuses on the averaging estimator. We propose a one-step approach to enhance a simple-averaging based distributed estimator. We derive the corresponding asymptotic properties of the newly proposed estimator. We find that the proposed one-step estimator enjoys the same asymptotic properties as the centralized estimator. The proposed one-step approach merely requires one additional round of communication in relative to the averaging estimator; so the extra communication burden is insignificant. In finite sample cases, numerical examples show that the proposed estimator outperforms the simple averaging estimator with a large margin in terms of the mean squared errors. A potential application of the one-step approach is that one can use multiple machines to speed up large scale statistical inference with little compromise in the quality of estimators. The proposed method becomes more valuable when data can only be available at distributed machines with limited communication bandwidth.
Key facts. Cited by 11 papers in the map (data through 14 Oct 2026). First posted on arXiv 4 Nov 2015.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 1; 2023: 2; 2024: 3; 2025: 0; 2026: 3.
11 papers.
- 2021Distributed Bootstrap for Simultaneous Inference Under High Dimensionalitycited by 4
- 2026Federated Language Models Under Bandwidth Budgets: Distillation Rates and Conformal Coveragecited by 3
- 2023Quasi-Newton Updating for Large-Scale Distributed Learningcited by 2
- 2024Distributed High-Dimensional Quantile Regression: Estimation Efficiency and Support Recoverycited by 2
- 2023Distributed Semi-Supervised Sparse Statistical Inferencecited by 1
- 2021Divide-and-conquer methods for big data analysiscited by 0
- 2022Distributed Estimation and Inference for Semi-parametric Binary Response Modelscited by 0
- 2024A Selective Review on Statistical Methods for Massive Data Computation: Distributed Computing, Subsampling, and Minibatch Techniquescited by 0
- 2024Minimax and Communication-Efficient Distributed Best Subset Selection with Oracle Propertycited by 0
- 2026Matching Rates and Optimal Allocation for Federated Probe-Logit Distillation under Heterogeneous Bandwidth Budgetscited by 0
- 2026Generalization Analysis of Distributed Kernel-based Robust Gradient Descent Algorithmscited by 0
- 2026Generalization Analysis of Distributed Kernel-based Robust Gradient Descent Algorithms10 Sep 2026
- 2026Matching Rates and Optimal Allocation for Federated Probe-Logit Distillation under Heterogeneous Bandwidth Budgets28 May 2026
- 2026Federated Language Models Under Bandwidth Budgets: Distillation Rates and Conformal Coverage11 May 2026
- 2024Minimax and Communication-Efficient Distributed Best Subset Selection with Oracle Property30 Aug 2024
- 2024Distributed High-Dimensional Quantile Regression: Estimation Efficiency and Support Recovery13 May 2024
- 2024A Selective Review on Statistical Methods for Massive Data Computation: Distributed Computing, Subsampling, and Minibatch Techniques17 Mar 2024
- 2023Distributed Semi-Supervised Sparse Statistical Inference17 Jun 2023
- 2023Quasi-Newton Updating for Large-Scale Distributed Learning7 Jun 2023
- 2022Distributed Estimation and Inference for Semi-parametric Binary Response Models15 Oct 2022
- 2021Divide-and-conquer methods for big data analysis22 Feb 2021
- 2021Distributed Bootstrap for Simultaneous Inference Under High Dimensionality19 Feb 2021