Counterfactual Identifiability via Dynamic Optimal Transport
Abstract
We address the open question of counterfactual identification for high-dimensional multivariate outcomes from observational data. Pearl (2000) argues that counterfactuals must be identifiable (i.e., recoverable from the observed data distribution) to justify causal claims. A recent line of work on counterfactual inference shows promising results but lacks identification, undermining the causal validity of its estimates. To address this, we establish a foundation for multivariate counterfactual identification using continuous-time flows, including non-Markovian settings under standard criteria. We characterise the conditions under which flow matching yields a unique, monotone and rank-preserving counterfactual transport map with tools from dynamic optimal transport, ensuring consistent inference. Building on this, we validate the theory in controlled scenarios with counterfactual ground-truth and demonstrate improvements in axiomatic counterfactual soundness on real images.
Cite
Text
Ribeiro et al. "Counterfactual Identifiability via Dynamic Optimal Transport." Advances in Neural Information Processing Systems, 2025.Markdown
[Ribeiro et al. "Counterfactual Identifiability via Dynamic Optimal Transport." Advances in Neural Information Processing Systems, 2025.](https://mlanthology.org/neurips/2025/ribeiro2025neurips-counterfactual/)BibTeX
@inproceedings{ribeiro2025neurips-counterfactual,
title = {{Counterfactual Identifiability via Dynamic Optimal Transport}},
author = {Ribeiro, Fabio De Sousa and Santhirasekaram, Ainkaran and Glocker, Ben},
booktitle = {Advances in Neural Information Processing Systems},
year = {2025},
url = {https://mlanthology.org/neurips/2025/ribeiro2025neurips-counterfactual/}
}