aiqbench analysis
This research introduces ABCDEFG, a scalable Bayesian method for causal discovery that guarantees exact acyclicity while handling unknown intervention targets. By leveraging amortized inference on extended factor graphs, the approach achieves state-of-the-art accuracy in reconstructing gene regulatory networks from large-scale perturbation data. The work advances machine learning capabilities for inferring complex biological systems where traditional score-based or approximate Bayesian methods often fail to provide identifiability guarantees.
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. In molecular biology, for example, a central goal is to uncover gene regulatory networks from large-scale perturbation data. An ideal algorithm for this task should scale to thousands of nodes, incorporate interventions even when their targets are unknown, quantify uncertainty, and provide identifiability guarantees. However, existing approaches---e.g. approaches using score-based optimization or approximate Bayesian inference---often fail to meet all of these criteria. To address these limitations, we develop Amortized Bayesian Causal Discovery of Extended Factor Graphs (ABCDEFG). Our method guarantees exact acyclicity, scales to graphs with thousands of nodes, and naturally handles interventions even when their targets are unknown. Additionally, ABCDEFG estimates a posterior distribution whose maximum a posteriori estimate provably identifies the true causal graph up to an equivalence class. On simulated datasets, ABCDEFG achieves state-of-the-art accuracy, producing a well-calibrated posterior distribution while outperforming previous score-based and approximate Bayesian methods. Applied to large-scale single-cell perturbation data, ABCDEFG identifies both established and novel gene targets of growth factors.
Abstract:Learning causal graphs from interventional data is a challenging problem with broad applications. In molecular biology, for example, a central goal is to uncover gene regulatory networks from large-scale perturbation data. An ideal algorithm for this task should scale to thousands of nodes, incorporate interventions even when their targets are unknown, quantify uncertainty, and provide identifiability guarantees. However, existing approaches---e.g. approaches using score-based optimization or approximate Bayesian inference---often fail to meet all of these criteria. To address these limitations, we develop Amortized Bayesian Causal Discovery of Extended Factor Graphs (ABCDEFG). Our method guarantees exact acyclicity, scales to graphs with thousands of nodes, and naturally handles interventions even when their targets are unknown. Additionally, ABCDEFG estimates a posterior distribution whose maximum a posteriori estimate provably identifies the true causal graph up to an equivalence class. On simulated datasets, ABCDEFG achieves state-of-the-art accuracy, producing a well-calibrated posterior distribution while outperforming previous score-based and approximate Bayesian methods. Applied to large-scale single-cell perturbation data, ABCDEFG identifies both established and novel gene targets of growth factors.
Machine Learning (stat.ML); Machine Learning (cs.LG); Molecular Networks (q-bio.MN)
arXiv:2607.22934 [stat.ML]
(or arXiv:2607.22934v1 [stat.ML] for this version)
https://doi.org/10.48550/arXiv.2607.22934 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 271 words
Related coverage

PIRAMID: Progress and Plans
LessWrong · Jul 27, 2026
FoundCause: Causal Discovery with Latent Confounders from Observational Data
arXiv · Jun 17, 2026

Unitary causal decompositions: a characterisation via lattice theory
Quantum Journal · Sep 30, 2026

Weird Cluster Hypothesis
LessWrong · Jul 29, 2026