Scores for Learning Discrete Causal Graphs with Unobserved Confounders
Open Access
- 24 March 2024
- journal article
- research article
- Published by Association for the Advancement of Artificial Intelligence (AAAI) in Proceedings of the AAAI Conference on Artificial Intelligence
- Vol. 38 (10) , 11043-11051
Abstract
Structural learning is arguably one of the most challenging and pervasive tasks found throughout the data sciences. There exists a growing literature that studies structural learning in non-parametric settings where conditional independence constraints are taken to define the equivalence class. In the presence of unobserved confounders, it is understood that non-conditional independence constraints are imposed over the observational distribution, including certain equalities and inequalities between functionals of the joint distribution. In this paper, we develop structural learning methods that leverage additional constraints beyond conditional independences. Specifically, we first introduce a score for arbitrary graphs combining Watanabe's asymptotic expansion of the marginal likelihood and new bounds over the cardinality of the exogenous variables. Second, we show that the new score has desirable properties in terms of expressiveness and computability. In terms of expressiveness, we prove that the score captures distinct constraints imprinted in the data, including Verma's and inequalities'. In terms of computability, we show properties of score equivalence and decomposability, which allows, in principle, to break the problem of structural learning in smaller and more manageable pieces. Third, we implement this score using an MCMC sampling algorithm and test its properties in several simulation scenarios.Keywords
This publication has 20 references indexed in Scilit:
- Linear Deconfounded Score Method: Scoring DAGs With Dense Unobserved ConfoundingIEEE Transactions on Neural Networks and Learning Systems, 2024
- A Bayesian Information Criterion for Singular ModelsJournal of the Royal Statistical Society Series B: Statistical Methodology, 2017
- Graphs for Margins of Bayesian NetworksScandinavian Journal of Statistics, 2015
- Algebraic Geometry and Statistical Learning Theory2009
- Marginal Likelihood Estimation via Power PosteriorsJournal of the Royal Statistical Society Series B: Statistical Methodology, 2008
- Binary Models for Marginal IndependenceJournal of the Royal Statistical Society Series B: Statistical Methodology, 2008
- Causal Protein-Signaling Networks Derived from Multiparameter Single-Cell DataScience, 2005
- Algebraic Analysis for Nonidentifiable Learning MachinesNeural Computation, 2001
- USING GRAPHICAL MODELS AND GENOMIC EXPRESSION DATA TO STATISTICALLY VALIDATE MODELS OF GENETIC REGULATORY NETWORKS2000
- Local Computations with Probabilities on Graphical Structures and Their Application to Expert SystemsJournal of the Royal Statistical Society Series B: Statistical Methodology, 1988