Penalized likelihood methods for estimation of sparse high-dimensional directed acyclic graphs
Open accessThe DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.
Abstract
Directed acyclic graphs are commonly used to represent causal relationships among random variables in graphical models. Applications of these models arise in the study of physical and biological systems where directed edges between nodes represent the influence of components of the system on each other. Estimation of directed graphs from observational data is computationally NP-hard. In addition, directed graphs with the same structure may be indistinguishable based on observations alone. When the nodes exhibit a natural ordering, the problem of estimating directed graphs reduces to the problem of estimating the structure of the network. In this paper, we propose an efficient penalized likelihood method for estimation of the adjacency matrix of directed acyclic graphs, when variables inherit a natural ordering. We study variable selection consistency of lasso and adaptive lasso penalties in high-dimensional sparse settings, and propose an error-based choice for selecting the tuning parameter. We show that although the lasso is only variable selection consistent under stringent conditions, the adaptive lasso can consistently estimate the true graph under the usual regularity assumptions.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Causality: Models, Reasoning, and Inference
Pearl, J. (2009) · doi:10.1017/cbo9780511803161 · Cited by 11,653
The adaptive lasso and its oracle properties
Zou, H. (2006) · Journal of the American Statistical Association · doi:10.1198/016214506000000735 · Cited by 7,470 · cited 2×
“Asymptotic properties of lasso-type estimates with fixed d sign matrices have been studied by a number of researchers (see e.g. Knight and Fu, 2000; Zou, 2006; Huang et al. , 2008).”
BackgroundWeak Convergence and Empirical Processes
van der Vaart, A. W., & Wellner, J. A. (1996) · Springer Series in Statistics · doi:10.1007/978-1-4757-2545-2 · Cited by 5,014
High-dimensional graphs and variable selection with the Lasso
Meinshausen, N., & Bühlmann, P. (2006) · The Annals of Statistics · doi:10.1214/009053606000000281 · Cited by 2,521
Model selection and estimation in the Gaussian graphical model
Yuan, M., & Lin, Y. (2007) · Biometrika · doi:10.1093/biomet/asm018 · Cited by 1,627 · cited 2×
“Banerjee et al.(2008) and Friedman et al. (2008b) explored different aspects of the problem of estimating the concentration matrix using the lasso penalty, while Yuan and Lin(2007) andFan et al.(2007) considered other choices for the penalty.”
Method
Cited by
D’ya Like DAGs? A Survey on Structure Learning and Causal Discovery
Vowels, M. J., Camgoz, N. C., & Bowden, R. (2023) · ACM Computing Surveys · doi:10.1145/3527154 · Cited by 237
“PC [228] 1993 constraint yes yes yes no CPDAG FCI [229, 275] 1995 constraint no yes yes no POIPG CCD [200] 1996 constraint yes yes both no PAG TPDA [31] 2002 constraint yes yes yes no CPDAG CPC [193] 2006 constraint yes relaxed yes no CPDAG KCL [233] 2007 constraint yes yes yes no CPDAG ION [241] 2008 constraint no ye…”
Metadata
- Authors
- Shojaie, A., & Michailidis, G.
- Venue
- Biometrika
- Publisher
- Oxford University Press (OUP)
- Published
- 2010-07-09
- Volume
- 97
- Issue
- 3
- Pages
- 519-538
- ISSN
- 0006-3444 (ISSN-L)
- 1464-3510
- OpenAlex
- W2124068344
- Cited by
- 173
- References
- 5
- FWCI
- 5.39
- Type
- journal article
- Language
- en
- Open access
- bronze
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Penalized likelihood methods for estimation of sparse high-dimensional directed acyclic graphs. https://app.cochat.ai/papers/10.1093/biomet/asq038
- The paper
- Shojaie, A., & Michailidis, G. (2010). Penalized likelihood methods for estimation of sparse high-dimensional directed acyclic graphs. Biometrika. https://doi.org/10.1093/biomet/asq038
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.