Abstract

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.

Related Publications

The Adaptive Lasso and Its Oracle Properties

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 w...

2006 Journal of the American Statistical A... 7303 citations

Publication Info

Year
2006
Type
article
Volume
34
Issue
3
Citations
2386
Access
Closed

External Links

Social Impact

Social media, news, blog, policy document mentions

Citation Metrics

2386
OpenAlex

Cite This

Nicolai Meinshausen, Peter Bühlmann (2006). High-dimensional graphs and variable selection with the Lasso. The Annals of Statistics , 34 (3) . https://doi.org/10.1214/009053606000000281

Identifiers

DOI
10.1214/009053606000000281