The adaptive lasso and its oracle properties

Research output: Contribution to journalArticle

3002 Scopus citations

Abstract

The lasso is a popular technique for simultaneous estimation and variable selection. Lasso variable selection has been shown to be consistent under certain conditions. In this work we derive a necessary condition for the lasso variable selection to be consistent. Consequently, there exist certain scenarios where the lasso is inconsistent for variable selection. We then propose a new version of the lasso, called the adaptive lasso, where adaptive weights are used for penalising different coefficients in the ℓ1 penalty. We show that the adaptive lasso enjoys the oracle properties; namely, it performs as well us if the true underlying model were given in advance. Similar to the lasso, the adaptive lasso is shown to be near-minimax optimal. Furthermore, the adaptive lasso can be solved by the same efficient algorithm for solving the lasso. We also discuss the extension of the adaptive lasso in generalized linear models and show that the oracle properties still hold under mild regularity conditions. As a byproduct of our theory, the nonnegalive garotte is shown to be consistent for variable selection.

Original languageEnglish (US)
Pages (from-to)1418-1429
Number of pages12
JournalJournal of the American Statistical Association
Volume101
Issue number476
DOIs
StatePublished - Dec 2006

Keywords

  • Asymptotic normality
  • Lasso
  • Minimax
  • Oracle inequality
  • Oracle procedure
  • Variable selection

Fingerprint Dive into the research topics of 'The adaptive lasso and its oracle properties'. Together they form a unique fingerprint.

  • Cite this