Counterfactual Identifiability via Dynamic Optimal Transport

arXiv stat.ML / 3/25/2026

💬 OpinionIdeas & Deep AnalysisModels & Research

Key Points

  • The paper tackles the problem of counterfactual identification for high-dimensional multivariate outcomes using observational data, addressing a gap in earlier counterfactual inference work that lacked formal identification guarantees.
  • It develops a foundation for multivariate counterfactual identification via continuous-time flows, extending the theory to non-Markovian settings under standard criteria.
  • Using dynamic optimal transport, the authors derive conditions under which flow matching produces a unique, monotone, and rank-preserving counterfactual transport map suitable for consistent inference.
  • The approach is validated in controlled experiments with known counterfactual ground truth and shows improved axiomatic counterfactual soundness on real image data.

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.