Overview

It asks what would happen if a variable or mechanism were deliberately changed, rather than merely observed, to estimate effects, test explanations, or choose actions. Common approaches include structural causal models and the do-calculus, randomized or targeted experiments, hard- and soft-intervention causal discovery, and counterfactual or Bayesian optimization methods that select interventions under costs. Applications range from gene perturbation and clinical policies to dynamical systems, robot control, and audits of neural-network features, evaluated with synthetic ground truth and real experimental or time-series data. Key challenges include limited or unknown intervention targets, hidden confounding and feedback, and whether conclusions transfer across environments; observational fit alone often cannot establish what an intervention will do.

Latest papers

96 papers7 papers in the last four weeks, down 22% on the four weeks before. 0.1% of all new papers.

Sep 2, 2025

Design of Experiment for Discovering Directed Mixed Graph

We study the design of interventions for causal discovery in simple structural causal models whose causal graphs are directed mixed graphs (DMGs) that may contain directed cycles and bidirected edges representing latent confounding. In such case, observational conditional-independence (CI) information may not identify even the graph skeleton, while CI alone cannot generally detect a bidirected edge coexisting with a directed edge. To this end, we propose a stage-wise framework based on tailored separating systems. Separating-system interventions first recover descendant relations and strongly connected components (SCCs). The SCCs are then ordered by ancestry, and an SCC-Anc separating system recovers the directed subgraph. Given this subgraph, further systems use CI tests interpreted through dd- or σσ-separation to recover non-adjacent bidirected edges, whose endpoints share no directed edge, and do-see comparisons to recover those coexisting with exactly one directed edge. Under our assumptions, the framework recovers the directed subgraph and every bidirected edge except double-adjacent ones, whose endpoints are connected by a directed edge in each direction. We develop algorithms for unrestricted and MM-bounded settings, with each experiment targeting at most MM variables in the latter. For recovering the directed subgraph and non-adjacent bidirected edges, our upper bounds on the number and maximum size of experiments match corresponding worst-case lower bounds up to logarithmic factors.
Jul 30, 2025

Diagrams-to-Dynamics (D2D): Exploring Causal Loop Diagram Leverage Points under Uncertainty

Background: Causal loop diagrams (CLDs) are widely used in health and environmental research to represent hypothesized causal structures underlying complex problems. However, as qualitative and static representations, CLDs are limited in their ability to support dynamic analysis and inform intervention strategies. We propose Diagrams-to-Dynamics (D2D), a method for converting CLDs into exploratory system dynamics models in the absence of empirical data. With minimal user input - following a protocol to label variables as stocks, flows or auxiliaries, and constants - D2D utilizes the structural information already encoded in CLDs, namely the existence and polarity of causal connections, to simulate hypothetical interventions and explore potentially influential places to intervene, known as 'leverage points,' under uncertainty. Results: D2D helps distinguish between high- and low-ranked leverage points. We compare D2D to a calibrated system dynamics model constructed from the same CLD and variable labels. D2D showed greater consistency with the calibrated model than did static network centrality analysis, while also providing uncertainty estimates and guidance for future data collection. Conclusions: The D2D method is implemented in an open-source Python package and a web-based application to support further testing and to lower the barrier to dynamic modeling for researchers working with CLDs. Future studies could help establish the approach's utility across a broad range of cases and domains.
Apr 3, 2025

Semiparametric Inference for Counterfactual Regression under Intervention-Driven Shift

We study counterfactual regression, which maps features to outcomes under hypothetical scenarios that differ from those observed in the data. This problem is central to decision-making under distribution shift, where treatment patterns may change at deployment. We develop a semiparametric framework for counterfactual regression along a prespecified incremental-intervention path. The target is a finite-dimensional constrained projection of counterfactual risk, estimated using cross-fitted influence-function representations of the program components. For smooth programs with fixed constraints and finite-dimensional programs with estimated linear constraints, we establish consistency and local stability of the optimizer under class-specific conditions, and derive pointwise and uniform first-order expansions. These results yield asymptotically valid inference, including simultaneous confidence bands for the counterfactual regression path. Simulations and an application to SMS reminders illustrate the finite-sample performance and practical applicability of the proposed approach.
Mar 3, 2025

ACTIVA: Amortized Causal Effect Estimation via Variational Autoencoders

Predicting post-intervention distributions from observational data is central to many scientific and decision-making problems, but remains challenging due to causal ambiguity, restrictive modeling assumptions, and the lack of amortization across tasks. We introduce ACTIVA, a transformer-based conditional variational autoencoder for amortized estimation of full interventional distributions from observational data and intervention queries. ACTIVA learns a conditional latent prior that amortizes causal knowledge across diverse training tasks, so that a new causal model drawn from the training distribution is handled in a single forward pass, without interventional data, a causal graph, or per-task fitting. Beyond the training distribution, only a parametric shift of the simulator is tested. We provide a population-level characterization of ACTIVA's estimand, showing that, under idealized expressivity and infinite samples assumptions, ACTIVA's learning objective targets a simulator-weighted mixture over the interventional distributions of causal models that are observationally compatible with the input. Empirically, on synthetic datasets and biologically realistic gene-expression simulations, ACTIVA substantially outperforms a correlational baseline, reduces spurious non-descendant effects, and achieves competitive performance relative to strong amortized baselines. On a pair of observationally equivalent models sharing a single observational dataset, ACTIVA recovers the predicted mixture, validating the theory in a finite-capacity model. Our results show that ACTIVA is a promising approach for estimating interventional distributions from observational data.
Feb 10, 2025

The Minimal Search Space for Conditional Causal Bandits

Causal knowledge can be used to support decision-making problems. This has been recognized in the causal bandits literature, where a causal (multi-armed) bandit is characterized by a causal graphical model and a target variable. The arms are then interventions on the causal model, and rewards are samples of the target variable. Causal bandits were originally studied with a focus on hard interventions. We focus instead on cases where the arms are conditional interventions, which more accurately model many real-world decision-making problems by allowing the value of the intervened variable to be chosen based on the observed values of other variables. This paper presents a graphical characterization of the minimal set of nodes guaranteed to contain the optimal conditional intervention, which maximizes the expected reward. We then propose an efficient algorithm with a time complexity of O(∣V∣+∣E∣)O(|V| + |E|) to identify this minimal set of nodes. We prove that the graphical characterization and the proposed algorithm are correct. Finally, we empirically demonstrate that our algorithm significantly prunes the search space and substantially accelerates convergence rates when integrated into standard multi-armed bandit algorithms.
Jan 31, 2025

What is causal about causal models and representations?

Causal Bayesian networks are often described as causal because they support reasoning about interventions. Yet interventions are defined in the mathematical model, whereas the resulting model predictions concern the effects of actions in the real world. Consequently, whether and how a causal model makes falsifiable predictions about the effects of actions depends on how actions are interpreted as interventions. This requires specifying which actions correspond to which interventions, a step that is frequently left implicit. We develop a formal framework that separates a causal model from the data-generating process it aims to describe and formalizes interpretations connecting actions to interventions. Within this framework, we prove an impossibility result: no interpretation can simultaneously satisfy a collection of desirable properties while remaining non-circular. Under a circular interpretation, every model that fits the observational distribution is interventionally valid, so no experiment can falsify it. We analyze several non-circular alternatives and discuss implications for falsification, causal discovery, causal representation learning, and causal abstraction. More broadly, our framework provides a way to make assumptions about the connections between actions and interventions explicit and to reason formally about the empirical content of causal models.