A spectral least-squares-type method for heavy-tailed corrupted regression with unknown covariance & heterogeneous noise
Not on the map. Why?
Abstract (arXiv)
We revisit heavy-tailed corrupted least-squares linear regression assuming to have a corrupted n-sized label-feature sample of at most ε n arbitrary outliers. We wish to estimate a p-dimensional parameter b^* given such sample of a label-feature pair (y,x) satisfying y=langle x,b^*rangle+xi with heavy-tailed (x,xi). We only assume x is L4-L2 hypercontractive with constant L>0 and has covariance matrix Sigma with minimum eigenvalue 1/μ2>0 and bounded condition number kappa>0. The noise xi can be arbitrarily dependent on x and nonsymmetric as long as xi x has finite covariance matrix Xi. We propose a near-optimal computationally tractable estimator, based on the power method, assuming no knowledge on (Sigma,Xi) nor the operator norm of Xi. With probability at least 1-δ, our proposed estimator attains the statistical rate μ2VertXiVert1/2(fracpn+fraclog(1/δ)n+ε)1/2 and breakdown-point εlesssimfrac1L4kappa2, both optimal in the ℓ2-norm, assuming the near-optimal minimum sample size L4kappa2(plog p + log(1/δ))lesssim n, up to a log factor. To the best of our knowledge, this is the first computationally tractable algorithm satisfying simultaneously all the mentioned properties. Our estimator is based on a two-stage Multiplicative Weight Update algorithm. The first stage estimates a descent direction hat v with respect to the (unknown) pre-conditioned inner product langleSigma(·),·rangle. The second stage estimate the descent direction Sigmahat v with respect to the (known) inner product langle·,·rangle, without knowing nor estimating Sigma.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 25 of its 40 references that are in the map. First posted on arXiv 6 Sep 2022.
Builds on
25 of 40 references.
References · 25
- 2016Robust Estimators in High Dimensions without the Computational Intractabilitycited by 209
- 2019Mean estimation and regression under heavy-tailed distributions--a surveycited by 133
- 2016Agnostic Estimation of Mean and Covariancecited by 131
- 2018Sever: A Robust Meta-Algorithm for Stochastic Optimizationcited by 123
- 2019Recent Advances in Algorithmic High-Dimensional Robust Statisticscited by 100
- 2018Robust Estimation via Robust Gradient Estimationcited by 76
- 2018Efficient Algorithms and Lower Bounds for Robust Linear Regressioncited by 76
- 2013Loss minimization and parameter estimation with heavy tailscited by 50
- 2020Robust regression with covariate filtering: Heavy tails and adversarial contaminationcited by 49
- 2015Robust Covariance and Scatter Matrix Estimation under Huber's Contamination Modelcited by 47
- 2020Robust and Heavy-Tailed Mean Estimation Made Simple, via Regret Minimizationcited by 44
- 2020Robust Linear Regression: Optimal Rates in Polynomial Timecited by 42
13 more
- 2019Quantum Entropy Scoring for Fast Robust Mean Estimation and Improved Outlier Detectioncited by 41
- 2018High-Dimensional Robust Mean Estimation in Nearly-Linear Timecited by 39
- 2019Robust subgaussian estimation of a mean vector in nearly linear timecited by 37
- 2018Mean Estimation with Sub-Gaussian Rates in Polynomial Timecited by 33
- 2019Outlier-robust estimation of a sparse linear model using ℓ1-penalized Huber's M-estimatorcited by 31
- 2020Optimal Robust Linear Regression in Nearly Linear Timecited by 31
- 2017Robust Regression via Mutivariate Regression Depthcited by 20
- 2020Robust estimation via generalized quasi-gradientscited by 19
- 2019Fast Mean Estimation with Sub-Gaussian Ratescited by 18
- 2021Robust Regression Revisited: Acceleration and Improved Estimation Ratescited by 15
- 2019A Fast Spectral Algorithm for Mean Estimation with Sub-Gaussian Ratescited by 12
- 2020A spectral algorithm for robust regression with subgaussian ratescited by 7
- 2020Outlier-robust sparse/low-rank least-squares regression and robust matrix completioncited by 6
Built on by
Not cited yet.