Non-negative least squares for high-dimensional linear models: consistency and sparse recovery without regularization

By Martin Slawski, Matthias Hein. 2012

199 citations recorded by the source corpus.

Least squares fitting is in general not useful for high-dimensional linear models, in which the number of predictors is of the same or even larger order of magnitude than the number of samples. Theory developed in recent years has coined a paradigm according to which sparsity-promoting regularization is regarded as a necessity in such setting. Deviating from this paradigm, we show that non-negativity constraints on the regression coefficients may be similarly effective as explicit regularization if the design matrix has additional properties, which are met in several applications of non-negative least squares (NNLS). We show that for these designs, the performance of NNLS with regard to prediction and estimation is comparable to that of the lasso. We argue further that in specific cases, NNLS may have a better $\ell_{\infty}$-rate in estimation and hence also advantages with respect to support recovery when combined with thresholding. From a practical point of view, NNLS does not depend on a regularization parameter and is hence easier to use.

Subfields: Applied Mathematics, Computational Mechanics, Signal Processing

View Paper: https://www.semanticscholar.org/paper/4616c8d3704aa9e18e3bd5e1c8a909ad0c56cddb

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Applied Mathematics

  1. Adityanand Guntuboyina
  2. Bodhisattva Sen
  3. Nicolai Meinshausen

In Computational Mechanics

  1. Adityanand Guntuboyina
  2. Bodhisattva Sen
  3. Nicolai Meinshausen
  4. Pierre C. Bellec
  5. Martin J. Wainwright
  6. Richard J. Samworth
  7. Cun-Hui Zhang
  8. Bin Yu

In Signal Processing

  1. Adityanand Guntuboyina
  2. Bodhisattva Sen
  3. Nicolai Meinshausen

Citations in the corpus