Debiased Counterfactual Generation via Flow Matching from Observations

• URL: http://arxiv.org/abs/2605.07665v1
• Date: Fri, 08 May 2026 12:35:21 GMT
• Title: Debiased Counterfactual Generation via Flow Matching from Observations
• Abstract summary: Estimating counterfactual distributions under interventions is central to treatment risk assessment and counterfactual generation tasks.<n>We show that under standard assumptions, observational and counterfactual outcome distributions are tightly linked.<n>These properties motivate learning counterfactual distributions not from scratch, but via a deconfounding flow from the observational distribution.
• Score: 4.188178237487111
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• Distributionally Faithful Imputation via Positive Semi-Definite Kernel Density Estimation [55.47411235954028]
  We recast imputation under missing completely at random as density estimation from masked observations.<n>We obtain a convex empirical risk problem with closed form marginals, solvable by a Newton interior point method.<n>The resulting PSD Impute model yields both single and multiple imputations from the same fitted density.
  arXiv  Detail & Related papers  (2026-07-08T15:51:05Z)
• Causality-Encoded Diffusion Models for Interventional Sampling and Edge Inference [12.531769483039405]
  We propose a causality-encoded diffusion framework that incorporates a known directed acyclic graph.<n>The resulting sampler approximately recovers the observational distribution and enables interventional sampling.<n>An application to flow data demonstrates practical utility of the proposed method in assessing disputed signalling linkages.
  arXiv  Detail & Related papers  (2026-04-23T16:32:49Z)
• Beyond the Mean: Modelling Annotation Distributions in Continuous Affect Prediction [3.3187704612685267]
  We propose a distribution-aware framework that models annotation consensus using the Beta distribution.<n>Instead of predicting a single affect value, models estimate the mean and standard deviation of the annotation distribution.<n>As a result, the model captures not only the central tendency of emotional perception but also variability, asymmetry, and uncertainty in annotator responses.
  arXiv  Detail & Related papers  (2026-04-08T15:26:56Z)
• Statistical Inference via Generative Models: Flow Matching and Causal Inference [0.0]
  Generative AI has achieved remarkable empirical success, but from the perspective of statistics it often remains opaque.<n>This book reinterprets generative AI in the language of statistics, using flow matching as a central example.
  arXiv  Detail & Related papers  (2026-03-09T22:56:02Z)
• Counterfactual Realizability [52.85109506684737]
  We introduce a formal definition of realizability, the ability to draw samples from a distribution, and then develop a complete algorithm to determine whether an arbitrary counterfactual distribution is realizable.<n>We illustrate the implications of this new framework for counterfactual data collection using motivating examples from causal fairness and causal reinforcement learning.
  arXiv  Detail & Related papers  (2025-03-14T20:54:27Z)
• Robust Probabilistic Model Checking with Continuous Reward Domains [1.7829696876801548]
  We propose a novel method for handling both continuous and discrete reward distributions in Discrete Time Markov Chains.<n>Our method approximates the reward distribution with theoretically bounded error while preserving the statistical properties of the true distribution.
  arXiv  Detail & Related papers  (2025-02-06T22:03:18Z)
• Theory on Score-Mismatched Diffusion Models and Zero-Shot Conditional Samplers [49.97755400231656]
  We present the first performance guarantee with explicit dimensional dependencies for general score-mismatched diffusion samplers.<n>We show that score mismatches result in an distributional bias between the target and sampling distributions, proportional to the accumulated mismatch between the target and training distributions.<n>This result can be directly applied to zero-shot conditional samplers for any conditional model, irrespective of measurement noise.
  arXiv  Detail & Related papers  (2024-10-17T16:42:12Z)
• Counterfactual Generative Models for Time-Varying Treatments [15.208067770012283]
  Estimating the counterfactual outcome of treatment is essential for decision-making in public health and clinical science. We propose a novel conditional generative framework capable of producing counterfactual samples under time-varying treatment. We present a thorough evaluation of our method using both synthetic and real-world data.
  arXiv  Detail & Related papers  (2023-05-25T05:45:53Z)
• Efficient CDF Approximations for Normalizing Flows [64.60846767084877]
  We build upon the diffeomorphic properties of normalizing flows to estimate the cumulative distribution function (CDF) over a closed region. Our experiments on popular flow architectures and UCI datasets show a marked improvement in sample efficiency as compared to traditional estimators.
  arXiv  Detail & Related papers  (2022-02-23T06:11:49Z)
• Predicting with Confidence on Unseen Distributions [90.68414180153897]
  We connect domain adaptation and predictive uncertainty literature to predict model accuracy on challenging unseen distributions. We find that the difference of confidences (DoC) of a classifier's predictions successfully estimates the classifier's performance change over a variety of shifts. We specifically investigate the distinction between synthetic and natural distribution shifts and observe that despite its simplicity DoC consistently outperforms other quantifications of distributional difference.
  arXiv  Detail & Related papers  (2021-07-07T15:50:18Z)
• Robust Correction of Sampling Bias Using Cumulative Distribution Functions [19.551668880584973]
  Varying domains and biased datasets can lead to differences between the training and the target distributions. Current approaches for alleviating this often rely on estimating the ratio of training and target probability density functions.
  arXiv  Detail & Related papers  (2020-10-23T22:13:00Z)
• Mind the Trade-off: Debiasing NLU Models without Degrading the In-distribution Performance [70.31427277842239]
  We introduce a novel debiasing method called confidence regularization. It discourages models from exploiting biases while enabling them to receive enough incentive to learn from all the training examples. We evaluate our method on three NLU tasks and show that, in contrast to its predecessors, it improves the performance on out-of-distribution datasets.
  arXiv  Detail & Related papers  (2020-05-01T11:22:55Z)

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.