The Dantzig selector and sparsity oracle inequalities
arXiv:0909.0861 · doi:10.3150/09-BEJ187
Abstract
Let \[Y_j=f_*(X_j)+ξ_j,\qquad j=1,...,n,\] where are i.i.d. random variables in a measurable space with distribution and are i.i.d. random variables with independent of Given a dictionary let , Given define \[\hatΛ_{\varepsilon}:=\Biggl\{\lam bda\in{\mathbb{R}}^N:\max_{1\leq k\leq N}\Biggl|n^{-1}\sum_{j=1}^n\big l(f_λ(X_j)-Y_j\bigr)h_k(X_j)\Biggr|\leq\varepsilon \Biggr\}\] and \[\hatλ:=\hatλ^{\varepsilon}\in \operatorname {Arg min}\limits_{λ\in\hatΛ_{\varepsilon}}\|λ\|_{\ell_1}.\] In the case where Candes and Tao [Ann. Statist. 35 (2007) 2313--2351] suggested using as an estimator of They called this estimator ``the Dantzig selector''. We study the properties of as an estimator of for regression models with random design, extending some of the results of Candes and Tao (and providing alternative proofs of these results).
Published in at http://dx.doi.org/10.3150/09-BEJ187 the Bernoulli (http://isi.cbs.nl/bernoulli/) by the International Statistical Institute/Bernoulli Society (http://isi.cbs.nl/BS/bshome.htm)
References in corpus (2)
Cited by in corpus (5)
- Sup-norm convergence rate and sign concentration property of Lasso and Dantzig estimators
- Some sharp performance bounds for least squares regression with regularization
- Adaptive Lasso for High Dimensional Regression and Gaussian Graphical Modeling
- Sparse recovery in convex hulls via entropy penalization
- High-dimensional stochastic optimization with the generalized Dantzig estimator