mlsanityData to 7 Oct 2026

Two-Stage Robust and Sparse Distributed Statistical Inference for Large-Scale Data

arXiv 2208.08230 ↗First posted 17 Aug 2022stat.ML cs.LG eess.SPcited by 1

Not on the map. Why?

Abstract (arXiv)

In this paper, we address the problem of conducting statistical inference in settings involving large-scale data that may be high-dimensional and contaminated by outliers. The high volume and dimensionality of the data require distributed processing and storage solutions. We propose a two-stage distributed and robust statistical inference procedures coping with high-dimensional models by promoting sparsity. In the first stage, known as model selection, relevant predictors are locally selected by applying robust Lasso estimators to the distinct subsets of data. The variable selections from each computation node are then fused by a voting scheme to find the sparse basis for the complete data set. It identifies the relevant variables in a robust manner. In the second stage, the developed statistically robust and computationally efficient bootstrap methods are employed. The actual inference constructs confidence intervals, finds parameter estimates and quantifies standard deviation. Similar to stage 1, the results of local inference are communicated to the fusion center and combined there. By using analytical methods, we establish the favorable statistical properties of the robust and computationally efficient bootstrap methods including consistency for a fixed number of predictors, and robustness. The proposed two-stage robust and distributed inference procedures demonstrate reliable performance and robustness in variable selection, finding confidence intervals and bootstrap approximations of standard deviations even when data is high-dimensional and contaminated by outliers.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 11 of its 56 references that are in the map. First posted on arXiv 17 Aug 2022.

Builds on

11 of 56 references.

References · 11

  1. 2018Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overviewcited by 159
  2. 2014Controlling the false discovery rate via knockoffscited by 97
  3. 2013Exact post-selection inference, with application to the lassocited by 90
  4. 2013Confidence Intervals and Hypothesis Testing for High-Dimensional Regressioncited by 78
  5. 2013A significance test for the lassocited by 20
  6. 2016Tuning parameter selection in high dimensional penalized likelihoodcited by 13
  7. 2017A Bootstrap Lasso + Partial Ridge Method to Construct Confidence Intervals for Parameters in High-dimensional Sparse Linear Modelscited by 4
  8. 2018Ultrahigh-dimensional Robust and Efficient Sparse Regression using Non-Concave Penalized Density Power Divergencecited by 3
  9. 2016The regularized tau estimator: A robust and efficient solution to ill-posed linear inverse problemscited by 2
  10. 2015Robust, scalable and fast bootstrap method for analyzing large scale datacited by 1
  11. 2020A robust variable screening procedure for ultra-high dimensional datacited by 1

Built on by

Cited by year

Citing papers per year: 2023: 1.

1 paper.