Cited by 2,521Statistical Methods and InferenceSparse and Compressive Sensing TechniquesBayesian Modeling and Causal Inference

High-dimensional graphs and variable selection with the Lasso

Open access
Meinshausen, Nicolai, Bühlmann, Peter·2006·The Annals of Statistics

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.

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1214/009053606000000281

Cites

13 of 13 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Lasso-regularized covariance selection methods can recover the off-diagonal structure of the covariance matrix.

    “These methods have the advantage to be able to recover the off diagonal structure of the covariance matrix.”

    From Signal Estimation and Uncertainties Extraction in Terahertz Time-Domain Spectroscopy (2025) · cites this paper as [57]

    The Abstract identifies the structural zeros targeted by covariance selection as entries of the inverse covariance matrix, not the covariance matrix. Section 3 says Lasso neighborhood selection recovers the graph’s edge set, which represents conditional-independence structure; it does not claim recovery of the covariance matrix’s off-diagonal structure. Page numbers are unavailable in our copy. (LLM, conf=0.87)

    Checked by a reasoning model — may be wrong.

    Experimental — accuracy not yet measured

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Cites

Flagged first, then by citations

Research works printed but not linked: 3

  1. [5]5. EDWARDS, D. (2000). Introduction to Graphical Modelling, 2nd ed. Springer, New York. MR1880319
  2. [12]12. LAURITZEN, S. (1996). Graphical Models. Clarendon Press, Oxford. MR1419991
  3. [17]17. VAN DER VAART, A. and WELLNER, J. (1996). Weak Convergence and Empirical Processes: With Applications to Statistics. Springer, New York. MR1385671

Cited by

Sorted by citations

Authors
Meinshausen, N., & Bühlmann, P.
Affiliations
ETH Zurich (CH)
Venue
The Annals of Statistics
Published
2006-06-01
Volume
34
Issue
3
Pages
1436-1462
ISSN
  • 0090-5364 (ISSN-L)
  • 2168-8966
OpenAlex
W2010824638
Cited by
2,521
References
13
Citations by year
2026: 91 · 2025: 162 · 2024: 153 · 2023: 123 · 2022: 207 · 2021: 166 · 2020: 182 · 2019: 199 · 2018: 171 · 2017: 155 · 2016: 154 · 2015: 117 · 2014: 133 · 2013: 103 · 2012: 114
FWCI
41.93
Type
journal article
Language
en
Open access
Locations
  • The Annals of Statistics (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • Project Euclid (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Mathematics › Statistics and Probability › Statistical Methods and Inference
  • Physical Sciences › Engineering › Computational Mechanics › Sparse and Compressive Sensing Techniques
  • Physical Sciences › Computer Science › Artificial Intelligence › Bayesian Modeling and Causal Inference
Keywords
neighborhood selection, LASSO, covariance selection, high-dimensional graphs, sparse graphs, feature selection, conditional independence, inverse covariance matrix, consistency, penalty parameter selection, oracle inequalities, exponential rate, linear Gaussian models

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review