High-dimensional consistency in score-based and hybrid structure learning
Open accessThe DOI matches its Crossref record; 9 of the 9 references it cites were found in a registry or an index.
Abstract
Main approaches for learning Bayesian networks can be classified as constraint-based, score-based or hybrid methods. Although high-dimensional consistency results are available for constraint-based methods like the PC algorithm, such results have not been proved for score-based or hybrid methods, and most of the hybrid methods have not even shown to be consistent in the classical setting where the number of variables remains fixed and the sample size tends to infinity. In this paper, we show that consistency of hybrid methods based on greedy equivalence search (GES) can be achieved in the classical setting with adaptive restrictions on the search space that depend on the current state of the algorithm. Moreover, we prove consistency of GES and adaptively restricted GES (ARGES) in several sparse high-dimensional settings. ARGES scales well to sparse graphs with thousands of variables and our simulation study indicates that both GES and ARGES generally outperform the PC algorithm.
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
An introduction to ROC analysis
Fawcett, T. (2006) · Pattern Recognition Letters · doi:10.1016/j.patrec.2005.10.010 · Cited by 21,879
Regularization Paths for Generalized Linear Models via Coordinate Descent
Friedman, J., Hastie, T., & Tibshirani, R. (2010) · Journal of Statistical Software · doi:10.18637/jss.v033.i01 · Cited by 19,927
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 11×
“Hence, Figure 4 does not represent the computational efficiency of the algorithms, but rather represents a comparison of their currently available implementations in R. by including adaptive LASSO [Zou (2006)].”
BackgroundMethodInfluentialCausation, Prediction, and Search
Spirtes, P., Glymour, C., & Scheines, R. (1993) · Lecture Notes in Statistics · doi:10.1007/978-1-4612-2748-9 · Cited by 4,617
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 · cited 3×
“We estimate the CIG for ARGES-CIG using neighborhood selection with the LASSO of Meinshausen and Bühlmann [2006], where we use the implementation in the R-package huge [Zhao et al.”
MethodA characterization of Markov equivalence classes for acyclic digraphs
Andersson, S. A., Madigan, D., & Perlman, M. D. (1997) · The Annals of Statistics · doi:10.1214/aos/1031833662 · Cited by 425 · cited 1×
“A Markov equivalence class of DAGs can be uniquely represented by a completed partially directed acyclic graph (CPDAG), which is a PDAG that satisfies the following: Xi → Xk in the CPDAG ifXi → Xk in every DAG in the Markov equivalence class, and Xi−Xk in the CPDAG if the Markov equivalence class contains a DAG in whi…”
BackgroundPredicting causal effects in large-scale systems from observational data
Maathuis, M. H., Colombo, D., Kalisch, M., & Bühlmann, P. (2010) · Nature Methods · doi:10.1038/nmeth0410-247 · Cited by 217 · cited 1×
“3151 and its variants [e.g., Harris and Drton (2013), Colombo and Maathuis (2014)] have been widely applied to high-dimensional datasets [e.g., Maathuis et al. (2010), Schmidberger, Lennert and Mansmann (2011), Stekhoven et al. (2012), Verdugo et al. (2013), Le et al. (2013), Gao and Cui (2015)],…”
BackgroundSelf-citationStatistics and causal inference: A review
Pearl, J. (2003) · Test · doi:10.1007/bf02595718 · Cited by 144
Cited by
A survey of Bayesian Network structure learning
Kitson, N. K., Constantinou, A. C., Guo, Z., Liu, Y., & Chobtham, K. (2023) · Artificial Intelligence Review · doi:10.1007/s10462-022-10351-w · Cited by 379
A Survey of Learning Causality with Data: Problems and Methods
Guo, R., Cheng, L., Li, J., Hahn, P. R., & Liu, H. (2021) · ACM Computing Surveys · doi:10.1145/3397269 · Cited by 362
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
“[260] 2020 score Granger – – no Bi Order-MCMC [60] 2003 sampling yes yes yes no DAG OG [53] 2008 sampling yes yes yes yes DAG EE-DAG [281] 2011 sampling yes yes yes yes DAG ZIPBN [35] 2020 sampling yes no yes no DAG LiNGAM [221] 2006 asymmetries yes no yes no DAG LV LiNGAM [101] 2008 asymmetries no yes yes no DAG non-…”
BackgroundHeinze-Deml, C., Maathuis, M. H., & Meinshausen, N. (2018) · Annual Review of Statistics and Its Application · doi:10.1146/annurev-statistics-031017-100630 · Cited by 169
“Nandy et al. (2017a) showed a close connection between score-based and constraint-based meth-ods for multivariate Gaussian data.”
BackgroundMethodInfluentialSelf-citationA Survey on Causal Discovery: Theory and Practice
Zanga, A., Ozkirimli, E., & Stella, F. (2022) · International Journal of Approximate Reasoning · doi:10.1016/j.ijar.2022.09.004 · Cited by 129
Metadata
- Authors
- Nandy, P., Hauser, A., & Maathuis, M. H.
- Venue
- The Annals of Statistics
- Publisher
- Institute of Mathematical Statistics
- Published
- 2018-12-01
- Volume
- 46
- Issue
- 6A
- Pages
- 3151-3183
- ISSN
- 0090-5364 (ISSN-L)
- OpenAlex
- W2337761434
- Cited by
- 98
- References
- 9
- FWCI
- 5.38
- Type
- journal article
- Language
- en
- Open access
- green
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: High-dimensional consistency in score-based and hybrid structure learning. https://app.cochat.ai/papers/10.1214/17-aos1654
- The paper
- Nandy, P., Hauser, A., & Maathuis, M. H. (2018). High-dimensional consistency in score-based and hybrid structure learning. The Annals of Statistics. https://doi.org/10.1214/17-aos1654
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.