Amortized Bayesian Causal Discovery of Extended Factor Graphs

• URL: http://arxiv.org/abs/2607.22934v1
• Date: Fri, 24 Jul 2026 22:19:20 GMT
• Title: Amortized Bayesian Causal Discovery of Extended Factor Graphs
• Abstract summary: In molecular biology, for example, a central goal is to uncover gene regulatory networks from large-scale perturbation data.<n>We develop Amortized Bayesian Causal Discovery of Extended Factor Graphs (ABCDEFG)<n>ABCDEFG guarantees exact acyclicity, scales to graphs with thousands of nodes, and naturally handles interventions even when their targets are unknown.
• Score: 29.543464906136876
• License: http://creativecommons.org/licenses/by/4.0/
• 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.

Related papers

• FedCIGAR: A Personalized Reconstruction Approach for Federated Graph-level Anomaly Detection [51.473064583839296]
  We propose a novel Federated graph-level anomaly detection approach with Cluster-adaptIve GAted Reconstruction (FedCIGAR)<n>Specifically, we design a reconstruction-based paradigm trained on normal graphs to avoid synthetic data. Furthermore, we introduce a client-side node contribution gating mechanism and a server-side sliding window-based clustering strategy to tackle data heterogeneity.
  arXiv  Detail & Related papers  (2026-05-10T09:03:54Z)
• Large-Scale Bayesian Causal Discovery with Interventional Data [0.0]
  Inferring causal relationships among a set of variables in the form of a directed acyclic graph (DAG) is an important but notoriously challenging problem.<n>We propose Interventional Bayesian Causal Discovery (IBCD), an empirical Bayesian framework for causal discovery with interventional data.
  arXiv  Detail & Related papers  (2025-10-02T01:16:04Z)
• Sample Efficient Bayesian Learning of Causal Graphs from Interventions [6.823521786512908]
  This study considers a Bayesian approach for learning causal graphs with limited interventional samples. We show theoretically that our proposed algorithm will return the true causal graph with high probability. We present a case study showing how this algorithm could be modified to answer more general causal questions without learning the whole graph.
  arXiv  Detail & Related papers  (2024-10-26T05:47:56Z)
• Large-Scale Targeted Cause Discovery via Learning from Simulated Data [66.51307552703685]
  We propose a novel machine learning approach for inferring causal variables of a target variable from observations.<n>We train a neural network using supervised learning on simulated data to infer causality.<n> Empirical results demonstrate superior performance in identifying causal relationships within large-scale gene regulatory networks.
  arXiv  Detail & Related papers  (2024-08-29T02:21:11Z)
• Adaptive Online Experimental Design for Causal Discovery [9.447864414136905]
  Causal discovery aims to uncover cause-and-effect relationships encoded in causal graphs. We focus on data interventional efficiency and formalize causal discovery from the perspective of online learning. We propose a track-and-stop causal discovery algorithm that adaptively selects interventions from the graph separating system.
  arXiv  Detail & Related papers  (2024-05-19T13:26:33Z)
• Resisting Graph Adversarial Attack via Cooperative Homophilous Augmentation [60.50994154879244]
  Recent studies show that Graph Neural Networks are vulnerable and easily fooled by small perturbations. In this work, we focus on the emerging but critical attack, namely, Graph Injection Attack. We propose a general defense framework CHAGNN against GIA through cooperative homophilous augmentation of graph data and model.
  arXiv  Detail & Related papers  (2022-11-15T11:44:31Z)
• Large-Scale Differentiable Causal Discovery of Factor Graphs [3.8015092217142223]
  We introduce the notion of factor directed acyclic graphs (f-DAGs) as a way to the search space to non-linear low-rank causal interaction models. We propose a scalable implementation of f-DAG constrained causal discovery for high-dimensional interventional data.
  arXiv  Detail & Related papers  (2022-06-15T21:28:36Z)
• BCD Nets: Scalable Variational Approaches for Bayesian Causal Discovery [97.79015388276483]
  A structural equation model (SEM) is an effective framework to reason over causal relationships represented via a directed acyclic graph (DAG) Recent advances enabled effective maximum-likelihood point estimation of DAGs from observational data. We propose BCD Nets, a variational framework for estimating a distribution over DAGs characterizing a linear-Gaussian SEM.
  arXiv  Detail & Related papers  (2021-12-06T03:35:21Z)
• Variational Causal Networks: Approximate Bayesian Inference over Causal Structures [132.74509389517203]
  We introduce a parametric variational family modelled by an autoregressive distribution over the space of discrete DAGs. In experiments, we demonstrate that the proposed variational posterior is able to provide a good approximation of the true posterior.
  arXiv  Detail & Related papers  (2021-06-14T17:52:49Z)
• Block-Approximated Exponential Random Graphs [77.4792558024487]
  An important challenge in the field of exponential random graphs (ERGs) is the fitting of non-trivial ERGs on large graphs. We propose an approximative framework to such non-trivial ERGs that result in dyadic independence (i.e., edge independent) distributions. Our methods are scalable to sparse graphs consisting of millions of nodes.
  arXiv  Detail & Related papers  (2020-02-14T11:42:16Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.