betaFeedback

WorksMathematics

Square-Root Lasso: Pivotal Recovery of Sparse Signals via Conic Programming

Abstract

We propose a pivotal method for estimating high-dimensional sparse linear regression models, where the overall number of regressors pp is large, possibly much larger than nn, but only ss regressors are significant. The method is a modification of the lasso, called the square-root lasso. The method is pivotal in that it neither relies on the knowledge of the standard deviation σσ or nor does it need to pre-estimate σσ. Moreover, the method does not rely on normality or sub-Gaussianity of noise. It achieves near-oracle performance, attaining the convergence rate σ{(s/n)log⁡p}1/2σ\{(s/n)\log p\}^{1/2} in the prediction norm, and thus matching the performance of the lasso with known σσ. These performance results are valid for both Gaussian and non-Gaussian errors, under some mild moment restrictions. We formulate the square-root lasso as a solution to a convex conic programming problem, which allows us to implement the estimator using efficient algorithmic methods, such as interior-point and first-order methods.

Paper details

vlnc:W_m2nm6jjg
Version
v2 · latest
Published
Added
License
arXiv nonexclusive license
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…