Translator Disclaimer
June 2006 High-dimensional graphs and variable selection with the Lasso
Nicolai Meinshausen, Peter Bühlmann
Ann. Statist. 34(3): 1436-1462 (June 2006). DOI: 10.1214/009053606000000281

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.

Citation

Download Citation

Nicolai Meinshausen. Peter Bühlmann. "High-dimensional graphs and variable selection with the Lasso." Ann. Statist. 34 (3) 1436 - 1462, June 2006. https://doi.org/10.1214/009053606000000281

Information

Published: June 2006
First available in Project Euclid: 10 July 2006

zbMATH: 1113.62082
MathSciNet: MR2278363
Digital Object Identifier: 10.1214/009053606000000281

Subjects:
Primary: 62J07
Secondary: 62F12, 62H20

Rights: Copyright © 2006 Institute of Mathematical Statistics

JOURNAL ARTICLE
27 PAGES


SHARE
Vol.34 • No. 3 • June 2006
Back to Top