paper-with-me

홈 › Papers

Out-of-sample error estimate for robust M-estimators with convex penalty

2020-08-26 · Pierre C. Bellec

A generic out-of-sample error estimate is proposed for robust $M$-estimators regularized with a convex penalty in high-dimensional linear regression where $(X,y)$ is observed and $p,n$ are of the same order. If $\psi$ is the derivative of the robust data-fitting loss $\rho$, the estimate depends on the observed data only through the quantities $\hat\psi = \psi(y-X\hat\beta)$, $X^\top \hat\psi$ and the derivatives $(\partial/\partial y) \hat\psi$ and $(\partial/\partial y) X\hat\beta$ for fixed $X$. The out-of-sample error estimate enjoys a relative error of order $n^{-1/2}$ in a linear model with Gaussian covariates and independent noise, either non-asymptotically when $p/n\le \gamma$ or asymptotically in the high-dimensional asymptotic regime $p/n\to\gamma'\in(0,\infty)$. General differentiable loss functions $\rho$ are allowed provided that $\psi=\rho'$ is 1-Lipschitz. The validity of the out-of-sample error estimate holds either under a strong convexity assumption, or for the $\ell_1$-penalized Huber M-estimator if the number of corrupted observations and sparsity of the true $\beta$ are bounded from above by $s_*n$ for some small enough constant $s_*\in(0,1)$ independent of $n,p$. For the square loss and in the absence of corruption in the response, the results additionally yield $n^{-1/2}$-consistent estimates of the noise variance and of the generalization error. This generalizes, to arbitrary convex penalty, estimates that were previously known for the Lasso.

📄 PDF Abstract BibTeX arXiv:2008.11840

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

Linear Regression Linear Regression is a method for modelling a relationship between a dependent variable and independent variables. These models can be fit with numerous approaches. The most…

Similar Papers 제목 키워드 기반

Asymptotic normality of robust $M$-estimators with convex penalty

2021-07-08 · Pierre C Bellec, Yiwei Shen, Cun-Hui Zhang

This paper develops asymptotic normality results for individual coordinates of robust M-estimators with convex penalty in high-dimensions, where the dimension $p$ is at most of the same order as the sample size $n$, i.e,…

Derivatives and residual distribution of regularized M-estimators with application to adaptive tuning

2021-07-11 · NeurIPS 2021 12 · Pierre C Bellec, Yiwei Shen

This paper studies M-estimators with gradient-Lipschitz loss function regularized with convex penalty in linear models with Gaussian design matrix and arbitrary noise distribution. A practical example is the robust M-est…

Rank-one Convexification for Sparse Regression

2019-01-29 · Alper Atamturk, Andres Gomez

Sparse regression models are increasingly prevalent due to their ease of interpretability and superior out-of-sample performance. However, the exact model of sparse regression with an $\ell_0$ constraint restricting the …

regression

On Low-rank Trace Regression under General Sampling Distribution

2019-04-18 · Nima Hamidi, Mohsen Bayati

In this paper, we study the trace regression when a matrix of parameters B* is estimated via the convex relaxation of a rank-regularized regression or via regularized non-convex optimization. It is known that these estim…

Matrix CompletionMulti-Task Learningregression

The cost-free nature of optimally tuning Tikhonov regularizers and other ordered smoothers

2019-05-29 · ICML 2020 1 · Pierre C. Bellec, Dana Yang

We consider the problem of selecting the best estimator among a family of Tikhonov regularized estimators, or, alternatively, to select a linear combination of these regularizers that is as good as the best regularizer i…

regression