A massive data framework for M-estimators with cubic-rate
From MaRDI portal
Abstract: The divide and conquer method is a common strategy for handling massive data. In this article, we study the divide and conquer method for cubic-rate estimators under the massive data framework. We develop a general theory for establishing the asymptotic distribution of the aggregated M-estimators using a simple average. Under certain condition on the growing rate of the number of subgroups, the resulting aggregated estimators are shown to have faster convergence rate and asymptotic normal distribution, which are more tractable in both computation and inference than the original M-estimators based on pooled data. Our theory applies to a wide class of M-estimators with cube root convergence rate, including the location estimator, maximum score estimator and value search estimator. Empirical performance via simulations also validate our theoretical findings.
Recommendations
- scientific article; zbMATH DE number 7071638
- Distributed statistical estimation and rates of convergence in normal approximation
- Distributed testing and estimation under sparse high dimensional models
- A partially linear framework for massive heterogeneous data
- Divide and conquer local average regression
Cites work
- scientific article; zbMATH DE number 3949394 (Why is no real title available?)
- scientific article; zbMATH DE number 5228082 (Why is no real title available?)
- A Scalable Bootstrap for Massive Data
- A partially linear framework for massive heterogeneous data
- A robust method for estimating optimal treatment regimes
- A split-and-conquer approach for analysis of
- An approximation of partial sums of independent RV'-s, and the sample DF. I
- Asymptotic normality of the \(L_1\) error of the Grenander estimator
- Cube root asymptotics
- Divide and conquer in nonstandard problems and the super-efficiency phenomenon
- Estimation of the mode
- Gaussian approximation of suprema of empirical processes
- Gaussian approximations and multiplier bootstrap for maxima of sums of high-dimensional random vectors
- Introduction to empirical processes and semiparametric inference
- Komlós-Major-Tusnády approximation for the general empirical process and Haar expansions of classes of functions
- Local invariance principles and their application to density estimation
- Measure Theory and Probability Theory
- On the application of probability theory to agricultural experiments. Essay on principles. Section 9. Translated from the Polish and edited by D. M. Dąbrowska and T. P. Speed
- On the asymptotics of constrained \(M\)-estimation
- Sharp asymptotics for isotonic regression
- Superefficiency in nonparametric function estimation
- Weak convergence and empirical processes. With applications to statistics
Cited in
(48)- Divide and conquer for generalized approximately expectile regression
- Distributed empirical likelihood inference with or without Byzantine failures
- Randomized sketches for kernel CCA
- Communication-Efficient Distributed Linear Discriminant Analysis for Binary Classification
- Approximating Partial Likelihood Estimators via Optimal Subsampling
- Distributed debiased estimation of high-dimensional partially linear models with jumps
- Distributed subdata selection for big data via sampling-based approach
- Communication-efficient distributed gradient descent via random projection
- An algorithm for distributed parameter estimation in modal regression models
- A Simple Divide-and-Conquer-based Distributed Method for the Accelerated Failure Time Model
- Efficient Nonparametric Estimation of 3D Point Cloud Signals through Distributed Learning
- Transformation-Invariant Learning of Optimal Individualized Decision Rules with Time-to-Event Outcomes
- Circumventing superefficiency: an effective strategy for distributed computing in non-standard problems
- Projected spline estimation of the nonparametric function in high-dimensional partially linear models for massive data
- Uniform inference in linear error-in-variables models: Divide-and-conquer
- First-Order Newton-Type Estimator for Distributed Estimation and Inference
- Distributed estimation with empirical likelihood
- Distributed penalizing function criterion for local polynomial estimation in nonparametric regression with massive data
- Communication-efficient distributed \(M\)-estimation with missing data
- Distributed Mallows model averaging for ridge regressions
- Optimal subsample selection for massive logistic regression with distributed data
- Distributed estimation in heterogeneous reduced rank regression: with application to order determination in sufficient dimension reduction
- Optimal subsampling for multiplicative regression with massive data
- Robust reduced rank regression in a distributed setting
- Discussion on the paper ‘A review of distributed statistical inference’
- Distributed estimation and inference for semiparametric binary response models
- Distributed Estimation for Principal Component Analysis: An Enlarged Eigenspace Analysis
- A framework for mediation analysis with massive data
- Divide and conquer in nonstandard problems and the super-efficiency phenomenon
- Divide-and-Conquer: A Distributed Hierarchical Factor Approach to Modeling Large-Scale Time Series Data
- Distributed linear regression by averaging
- Global debiased DC estimations for biased estimators via pro forma regression
- DDAC-SpAM: A Distributed Algorithm for Fitting High-dimensional Sparse Additive Models with Feature Division and Decorrelation
- Distributed Sparse Composite Quantile Regression in Ultrahigh Dimensions
- Quantile regression under memory constraint
- Multi-round smoothed composite quantile regression for distributed data
- Distributed inference for linear support vector machine
- Distributed Tensor Principal Component Analysis with Data Heterogeneity
- Distributed quantile regression in decentralized optimization
- Distributed SGD in overparametrized linear regression
- Distributed testing on mutual independence of massive multivariate data
- Communication-Efficient Accurate Statistical Estimation
- Optimal subsampling for modal regression in massive data
- Score-matching representative approach for big data analysis with generalized linear models
- Sampling-based estimation for massive survival data with additive hazards model
- Distributed feature screening via componentwise debiasing
- scientific article; zbMATH DE number 7306878 (Why is no real title available?)
- Divide and conquer local average regression
This page was built for publication: A massive data framework for M-estimators with cubic-rate
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3121561)
