PACER: Acyclic Causal Discovery from Large-Scale Interventional Data

• URL: http://arxiv.org/abs/2605.15353v1
• Date: Thu, 14 May 2026 19:26:53 GMT
• Title: PACER: Acyclic Causal Discovery from Large-Scale Interventional Data
• Abstract summary: PACER is a scalable framework for causal discovery that guarantees acyclicity by construction.<n>It supports a unified likelihood-based treatment of observational and interventional data.<n>It matches or exceeds state-of-the-art methods on protein signaling and large-scale genetic perturbation benchmarks.
• Score: 8.724450642752103
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Inferring the structure of directed acyclic graphs (DAGs) from data is a central challenge in causal discovery, particularly in modern high-dimensional settings where large-scale interventional data are increasingly available. While interventional data can improve identifiability, existing methods remain limited by soft acyclicity constraints, leading to optimization over invalid cyclic graphs, numerical instability, and reduced scalability. We introduce PACER (Perturbation-driven Acyclic Causal Edge Recovery), a scalable framework for causal discovery that guarantees acyclicity by construction. PACER parameterizes a distribution over DAGs through a joint model of variable permutations and edge probabilities, enabling direct optimization over valid causal structures without surrogate penalties. The framework supports a unified likelihood-based treatment of observational and interventional data, flexible conditional density models, and the incorporation of structural prior knowledge. For linear-Gaussian mechanisms, we derive closed-form expressions for the expected interventional log-likelihood and its gradients, yielding substantial computational gains. Empirically, PACER matches or exceeds state-of-the-art methods on protein signaling and large-scale genetic perturbation benchmarks, while scaling efficiently to networks with thousands of variables and achieving up to two orders of magnitude speedups over penalty-based differentiable approaches. These results demonstrate that exact and scalable causal discovery from high-dimensional perturbation data is achievable through principled search space design.

Related papers

• Causal ASCEND: Scalable Two-tier Causal Discovery on High Dimensional Multi-omics Data [0.0]
  We present ASCEND, a constraint-based framework that leverages known two-tiered structure to enable genome-scale causal discovery.<n> ASCEND accurately recovers ancestral relationships, scales properly and much faster than existing gene regulatory network inference methods.<n>It is particularly suited for integrating multi-omic data where upstream regulators (e.g. SNPs, methylation sites) and downstream responses (e.g., gene expression) are measured jointly.
  arXiv  Detail & Related papers  (2026-07-05T22:22:35Z)
• TabCausal: Pretraining Across Causal Environments for Tabular Causal Discovery [47.81267771630766]
  Causal discovery foundation models (CDFMs) seek to amortize this problem by mapping a dataset directly to a causal graph in a single forward pass.<n>We propose TabCausal, a data-driven CDFM trained with broad causal pretraining over diverse graph priors.
  arXiv  Detail & Related papers  (2026-05-29T11:05:43Z)
• Concomitant DAG Learning: On the Roles of Noise Adaptivity, Sparsity, and Non-negativity [14.977112037008224]
  Directed acyclic graphs (DAGs) enable principled reasoning about cause-effect interactions in complex systems.<n>Most classical structure identification approaches face two key obstacles: the challenge of enforcing acyclicity, and identifiability challenges arising from latent or heterogeneous noise.<n>This tutorial offers an overview of recent signal processing and advances that address these issues by recasting DAG structure learning as a continuous, score-based estimation problem.
  arXiv  Detail & Related papers  (2026-05-22T12:00:00Z)
• Learning Causality for Longitudinal Data [1.2691047660244335]
  This thesis develops methods for causal inference and causal representation learning in high-dimensional, time-varying data.<n>The first contribution introduces the Causal Dynamic Variational Autoencoder (CDVAE), a model for estimating Individual Treatment Effects (ITEs)<n>The second contribution proposes an efficient framework for long-term counterfactual regression based on RNNs enhanced with Contrastive Predictive Coding ( CPC) and InfoMax.<n>The third contribution advances CRL by addressing how latent causes manifest in observed variables.
  arXiv  Detail & Related papers  (2025-12-04T16:51:49Z)
• Causal Discovery for Linear DAGs with Dependent Latent Variables via Higher-order Cumulants [7.808674222118538]
  Existing methods assume mutually independent latent confounders or cannot properly handle models with causal relationships among observed variables.<n>We propose a novel algorithm that identifies causal DAGs in LvLiNGAM, allowing causal structures among latent variables, among observed variables, and between the two.
  arXiv  Detail & Related papers  (2025-10-16T15:15:20Z)
• 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)
• Causal Inference from Slowly Varying Nonstationary Processes [2.3072402651280517]
  Causal inference from observational data hinges on asymmetry between cause and effect from the data generating mechanisms. We propose a new class of restricted structural causal models, via a time-varying filter and stationary noise, and exploit the asymmetry from nonstationarity for causal identification.
  arXiv  Detail & Related papers  (2024-05-11T04:15:47Z)
• Score-based Causal Representation Learning with Interventions [54.735484409244386]
  This paper studies the causal representation learning problem when latent causal variables are observed indirectly. The objectives are: (i) recovering the unknown linear transformation (up to scaling) and (ii) determining the directed acyclic graph (DAG) underlying the latent variables.
  arXiv  Detail & Related papers  (2023-01-19T18:39:48Z)
• BCDAG: An R package for Bayesian structure and Causal learning of Gaussian DAGs [77.34726150561087]
  We introduce the R package for causal discovery and causal effect estimation from observational data. Our implementation scales efficiently with the number of observations and, whenever the DAGs are sufficiently sparse, the number of variables in the dataset. We then illustrate the main functions and algorithms on both real and simulated datasets.
  arXiv  Detail & Related papers  (2022-01-28T09:30:32Z)
• 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)
• Learning Neural Causal Models with Active Interventions [83.44636110899742]
  We introduce an active intervention-targeting mechanism which enables a quick identification of the underlying causal structure of the data-generating process. Our method significantly reduces the required number of interactions compared with random intervention targeting. We demonstrate superior performance on multiple benchmarks from simulated to real-world data.
  arXiv  Detail & Related papers  (2021-09-06T13:10:37Z)
• Efficient Neural Causal Discovery without Acyclicity Constraints [30.08586535981525]
  We present ENCO, an efficient structure learning method for directed, acyclic causal graphs. In experiments, we show that ENCO can efficiently recover graphs with hundreds of nodes, an order of magnitude larger than what was previously possible.
  arXiv  Detail & Related papers  (2021-07-22T07:01:41Z)
• 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)

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.