Outlier-robust estimation of a sparse linear model using -penalized Huber's -estimator
arXiv:1904.06288
Abstract
We study the problem of estimating a -dimensional -sparse vector in a linear model with Gaussian design and additive noise. In the case where the labels are contaminated by at most adversarial outliers, we prove that the -penalized Huber's -estimator based on samples attains the optimal rate of convergence , up to a logarithmic factor. For more general design matrices, our results highlight the importance of two properties: the transfer principle and the incoherence property. These properties with suitable constants are shown to yield the optimal rates, up to log-factors, of robust estimation with adversarial contamination.
arXiv commentThis is a follow up paper of arXiv:1805.08020
References in corpus (9)
- Simultaneous analysis of Lasso and Dantzig selector
- Robust Regression via Hard Thresholding
- The lower tail of random quadratic forms, with applications to ordinary least squares and restricted eigenvalue properties
- Compressed sensing with sparse corruptions: Fault-tolerant sparse collocation approximations
- High Dimensional Robust Sparse Regression
- Adaptive Hard Thresholding for Near-optimal Consistent Robust Regression
- Robust Regression via Mutivariate Regression Depth
- Convex programming approach to robust estimation of a multivariate Gaussian model
- Minimax estimation of a p-dimensional linear functional in sparse Gaussian models and robust estimation of the mean