Linear and conic programming estimators in high dimensional errors-in-variables models

Alexandre Belloni

doi:10.1111/rssb.12196

Linear and conic programming estimators in high dimensional errors-in-variables models

2016-07-02

39

OA

AI

Alexandre B. Tsybakov

DOI：10.1111/rssb.12196

原文链接

查看原文

摘要

En 中文

We consider the linear regression model with observation error in the design. In this setting, we allow the number of covariates to be much larger than the sample size. Several new estimation methods have been recently introduced for this model. Indeed, the standard lasso estimator or Dantzig selector turns out to become unreliable when only noisy regressors are available, which is quite common in practice. In this work, we propose and analyse a new estimator for the errors-in-variables model. Under suitable sparsity assumptions, we show that this estimator attains the minimax efficiency bound. Importantly, this estimator can be written as a second-order cone programming minimization problem which can be solved numerically in polynomial time. Finally, we show that the procedure introduced by Rosenbaum and Tsybakov, which is almost optimal in a minimax sense, can be efficiently computed by a single linear programming problem despite non-convexities.

Keyword:

Conic programming

Dantzig selector

Linear regression model

Matrix uncertainty selector

Prediction sensitivity

Linear and conic programming estimators in high dimensional errors-in-variables models

摘要

AI总结

期刊

机构