mlsanityData to 7 Oct 2026

Optimal transport weights for causal inference

arXiv 2109.01991 ↗First posted 5 Sep 2021stat.ME cs.LG econ.EMcited by 7

Not on the map. Why?

Abstract (arXiv)

Imbalance in covariate distributions leads to biased estimates of causal effects. Weighting methods attempt to correct this imbalance but rely on specifying models for the treatment assignment mechanism, which is unknown in observational studies. This leaves researchers to choose the proper weighting method and the appropriate covariate functions for these models without knowing the correct combination to achieve distributional balance. In response to these difficulties, we propose a nonparametric generalization of several other weighting schemes found in the literature: Causal Optimal Transport. This new method directly targets distributional balance by minimizing optimal transport distances between treatment and control groups or, more generally, between any source and target population. Our approach is semiparametrically efficient and model-free but can also incorporate moments or any other important functions of covariates that a researcher desires to balance. Moreover, our method can provide nonparametric estimate the conditional mean outcome function and we give rates for the convergence of this estimator. Moreover, we show how this method can provide nonparametric imputations of the missing potential outcomes and give rates of convergence for this estimator. We find that Causal Optimal Transport outperforms competitor methods when both the propensity score and outcome models are misspecified, indicating it is a robust alternative to common weighting methods. Finally, we demonstrate the utility of our method in an external control trial examining the effect of misoprostol versus oxytocin for the treatment of post-partum hemorrhage.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 18 of its 77 references that are in the map. First posted on arXiv 5 Sep 2021.

Builds on

18 of 77 references.

References · 18

  1. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,160
  2. 2021Convex optimizationcited by 2,479
  3. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  4. 2018Computational Optimal Transportcited by 765
  5. 2017Learning Generative Models with Sinkhorn Divergencescited by 310
  6. 2017Near-linear time approximation algorithms for optimal transport via Sinkhorn iterationcited by 219
  7. 2015On Wasserstein Two Sample Testing and Related Families of Nonparametric Testscited by 165
  8. 2018Computational Optimal Transport: Complexity by Accelerated Gradient Descent Is Better Than by Sinkhorn's Algorithmcited by 111
  9. 2019Statistical bounds for entropic optimal transport: sample complexity and the central limit theoremcited by 85
  10. 2017Smooth and Sparse Optimal Transportcited by 83
  11. 2016Balancing Covariates via Propensity Score Weightingcited by 65
  12. 2016Generalized Optimal Matching Methods for Causal Inferencecited by 39
6 more
  1. 2020Debiased Sinkhorn barycenterscited by 34
  2. 2016Inference for Empirical Wasserstein Distances on Finite Spacescited by 21
  3. 2017Minimal Dispersion Approximately Balancing Weights: Asymptotic Properties and Practical Considerationscited by 18
  4. 2019Kernel Optimal Orthogonality Weighting: A Balancing Approach to Estimating Effects of Continuous Treatmentscited by 6
  5. 2020Reweighting samples under covariate shift using a Wasserstein distance criterioncited by 3
  6. 2019Large Sample Properties of Matching for Balancecited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 1; 2022: 0; 2023: 2; 2024: 3; 2025: 0; 2026: 1.

7 papers.