Amortized Bayesian Causal Discovery of Extended Factor Graphs
arXiv:2607. 22934v1 Announce Type: cross Abstract: Learning causal graphs from interventional data is a challenging problem with broad applications.
arXiv:2608. 12640v1 Announce Type: cross Abstract: Causal discovery aims to uncover the underlying causal relationships given data generated from a system.
arXiv:2607. 22934v1 Announce Type: cross Abstract: Learning causal graphs from interventional data is a challenging problem with broad applications.
arXiv:2608. 04930v1 Announce Type: cross Abstract: Bayesian causal discovery seeks to determine the posterior distribution of causal theories, which are interpreted as directed acyclic graphs (DAGs) that explain the observed data.
arXiv:2606. 06440v1 Announce Type: new Abstract: Data-driven causal relationship identification is pertinent to advancing understanding of complex systems both within and beyond science.
arXiv:2607. 04447v1 Announce Type: new Abstract: Local causal discovery is a scalable alternative to global structure learning.
arXiv:2602. 01483v2 Announce Type: replace-cross Abstract: We propose causal preference elicitation, a Bayesian framework for expert-in-the-loop causal discovery that actively queries local edge relations to concentrate a posterior over directed acyclic graphs (DAGs).
arXiv:2607. 11508v1 Announce Type: cross Abstract: Causal discovery, the process of recovering underlying causal structures from observational data, is a fundamental pursuit across scientific disciplines.
arXiv:2602. 14972v2 Announce Type: replace Abstract: Estimating causal quantities traditionally relies on bespoke estimators tailored to specific assumptions.
The paper introduces a variational inference framework that jointly discovers latent clusters of variables and the causal relationships among those clusters. It models clusters with categorical distributions and graph structures with Bernoulli distributions, deriving variational lower bounds and estimation techniques for learning both cluster assignments and causal links. The method’s effectiveness is shown on synthetic and real datasets.
The paper introduces Cluster-DAGs as a flexible prior knowledge framework to improve causal discovery. It presents two modified constraint‑based algorithms, Cluster‑PC and Cluster‑FCI, tailored for fully and partially observed data. Experiments on simulated data show that these methods outperform baseline algorithms that lack prior knowledge.
arXiv:2601.01368v2 Announce Type: replace Abstract: Score-based causal discovery in the presence of unobserved confounders requires both a consistent scoring criterion and an efficient search over gr...
arXiv:2606. 07525v1 Announce Type: cross Abstract: Causal graphs in text are typically populated by observable, predefined events.
arXiv:2607. 10456v1 Announce Type: cross Abstract: Expert background knowledge is often available in practical applications of causal discovery.