stat.MLMay 21, 2025

Generative Flows for Potential Outcomes and Counterfactuals

Authors: Dongze Wu, David I. Inouye, Yao Xie

Organizations: School of Industrial and Systems Engineering Georgia Institute of Technology Atlanta, GA · Elmore Family School of Electrical and Computer Engineering Purdue University West Lafayette, IN

Abstract

Average treatment effects summarize how interventions change outcomes, but individualized decisions require predictions and outcome distributions of what would have happened to the same individual under an alternative treatment. We develop PO-Flow, a continuous normalizing flow framework that represents treatment-specific outcome distributions through invertible transport maps. It supports potential-outcome generation, conditional average treatment-effect estimation, factual-conditioned counterfactual prediction, and density evaluation. To address treatment imbalance in observational data, we incorporate cross-fitted inverse-probability weighting into the flow-matching loss. We establish sufficient conditions under which encoding a factual outcome and decoding under an alternative treatment recovers the individual counterfactual. Under shared exogenous noise and a common encoded reference distribution, scalar recovery follows from increasing noise-to-latent maps. For multivariate outcomes, we assume triangularity or a convex-gradient structure. These conditions distinguish fitting outcome distributions from recovering their causal correspondence. Experiments on four scalar benchmarks and seven multivariate or image settings, with dimensions up to 784, compare against ten scalar and five multivariate baselines. Controlled ablations show IPW improves all reported scalar counterfactual RMSE, PEHE, and potential-outcome RMSE. PO-Flow achieves the lowest PEHE and potential-outcome RMSE on all four scalar benchmarks and attains or ties the lowest mean in 26 of 35 multivariate dataset--metric comparisons.

Figures & tables

Appendix figures & tables3 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

May 8, 2026

Debiased Counterfactual Generation via Flow Matching from Observations

Estimating counterfactual distributions under interventions is central to treatment risk assessment and counterfactual generation tasks. Existing approaches model the counterfactual distribution as a standalone generative target, without exploiting its relationship to the observational data. In this work, we show that under standard assumptions, observational and counterfactual outcome distributions are tightly linked: they have identical support and tail behavior, remain statistically close under weak confounding, and share any features of high-dimensional outcomes which are invariant to confounders. These properties motivate learning counterfactual distributions not from scratch, but via a deconfounding flow from the observational distribution. We formulate this problem via flow-matching and derive a semiparametrically efficient estimator based on a novel efficient influence function correction. We subsequently extend our estimator to target minimal-energy flows in high-dimensions, which we show can be especially simple targets between observational and counterfactual distributions. In experiments, deconfounding flows outperform existing debiased counterfactual distribution estimators, while also mitigating known failure modes of flow-based methods.
Oct 1, 2026

Counterfactual Generation via Flow Matching: Coupling-Sensitive End-to-End Rates

Counterfactual generation seeks to sample outcomes under a hypothetical intervention or decision using observational data collected under the factual assignment mechanism. We develop a flow-matching approach that combines a sample-split, doubly robust training objective with a learned coupling between observed source outcomes and target outcomes drawn from a fitted conditional outcome model. To enable finite-step generation, we leverage a score-corrected stochastic sampler based on a Gaussian-smoothed interpolation. Our main theoretical contribution is a coupling-sensitive KL bound for constant-step Euler discretization: the error is controlled by moments of the source--target displacement under the chosen coupling, rather than by global uniform regularity of the velocity field, and has near-linear dependence on the ambient dimension. We also establish finite-sample non-parametric guarantees for the learned velocity and score fields when both the conditional outcome model and the source-target coupling are estimated from data. These bounds separate approximation, coupling-replacement, nuisance-estimation, generalization, and Monte Carlo errors and, combined with the sampler analysis, yield an end-to-end guarantee for counterfactual generation. Experiments on synthetic and semi-synthetic image benchmarks support the coupling-dependent theory and show that, at finite discretization budgets, the stochastic sampler can outperform the corresponding deterministic ODE sampler.
Sep 26, 2026

CAFE: Counterfactual Prediction via Fast Posterior Estimation

Counterfactual prediction estimates an individual's outcome under an alternative intervention given their factual observations. Such outcomes are generally not identifiable from observational data without additional assumptions. Even within the class of fully observed additive noise models (ANMs), different causal graphs can generate the same observational distribution yet imply different individual counterfactual outcomes. Predictions based on a single estimated graph ignore this structural uncertainty. We therefore target a Bayesian counterfactual posterior predictive distribution that combines predictions from plausible SCMs. We introduce CAFE (CounterfActual Prediction via Fast Posterior Estimation), an amortized inference framework that directly approximates the Bayesian counterfactual posterior predictive distribution. We pretrain a transformer-based model on synthetic counterfactual tasks generated from a diverse prior over ANMs. Given an observational dataset, an individual's factual observations, and an intervention, CAFE approximates the corresponding posterior predictive distribution in a single forward pass. Experiments show that CAFE accurately predicts individual counterfactual outcomes in identifiable settings and approximates the posterior predictive distribution when structural uncertainty induced by observationally indistinguishable causal graphs exists. Strong performance in realistic manufacturing and viticulture settings further demonstrates its empirical robustness beyond the assumptions of the training prior.