High-dimensional graphs and variable selection with the Lasso

By Nicolai Meinshausen, Peter Buhlmann. 2006

3,959 citations recorded by the source corpus.

The pattern of zero entries in the inverse covariance matrix of a multivariate normal distribution corresponds to conditional independence restrictions between variables. Covariance selection aims at estimating those structural zeros from data. We show that neighborhood selection with the Lasso is a computationally attractive alternative to standard covariance selection for sparse high-dimensional graphs. Neighborhood selection estimates the conditional independence restrictions separately for each node in the graph and is hence equivalent to variable selection for Gaussian linear models. We show that the proposed neighborhood selection scheme is consistent for sparse high-dimensional graphs. Consistency hinges on the choice of the penalty parameter. The oracle value for optimal prediction does not lead to a consistent neighborhood estimate. Controlling instead the probability of falsely joining some distinct connectivity components of the graph, consistent estimation for sparse graphs is achieved (with exponential rates), even when the number of variables grows as the number of observations raised to an arbitrary power.

Subfields: Artificial Intelligence, Statistics and Probability, Statistical Learning Theory, Mathematical Optimization

How researchers see this paper

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

In Artificial Intelligence

  1. Yoshua Bengio
  2. Percy Liang
  3. Michael I. Jordan
  4. Quoc V. Le
  5. Sergey Levine
  6. Mohit Bansal
  7. Francis R. Bach
  8. Tong Zhang

In Statistics and Probability

  1. Peter Buhlmann
  2. Martin J. Wainwright
  3. Sara A. van de Geer
  4. Cun-Hui Zhang
  5. Jianqing Fan
  6. Nicolai Meinshausen
  7. Francis R. Bach
  8. Robert Tibshirani

In Statistical Learning Theory

  1. Francis R. Bach
  2. Martin J. Wainwright
  3. Tong Zhang
  4. Peter Buhlmann
  5. Cun-Hui Zhang
  6. Bin Yu
  7. Nicolai Meinshausen
  8. Michael I. Jordan

In Mathematical Optimization

  1. Robert Tibshirani
  2. Martin J. Wainwright
  3. Peter Buhlmann
  4. Sara A. van de Geer
  5. Stefan Wager
  6. Trevor J. Hastie
  7. Bin Yu
  8. Han Liu

Citations in the corpus