Matching for causal effects via multimarginal unbalanced optimal transport
Matching on covariates is a well-established framework for estimating causal effects in observational studies. The principal challenge stems from the often high-dimensional structure of the problem. Many methods have been introduced to address this, with different advantages and drawbacks in computational and statistical performance as well as interpretability. This article introduces a natural optimal matching method based on multimarginal unbalanced optimal transport that possesses many useful properties in this regard. It provides interpretable weights based on the distance of matched individuals, can be efficiently implemented via the iterative proportional fitting procedure, and can match several treatment arms simultaneously. Importantly, the proposed method only selects good matches from either group, hence is competitive with the classical k-nearest neighbors approach in terms of bias and variance in finite samples. Moreover, we prove a central limit theorem for the empirical process of the potential functions of the optimal coupling in the unbalanced optimal transport problem with a fixed penalty term. This implies a parametric rate of convergence of the empirically obtained weights to the optimal weights in the population for a fixed penalty term.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
On Multimarginal Partial Optimal Transport: Equivalent Forms and Computational Complexity
We study the multi-marginal partial optimal transport (POT) problem between $m$ discrete (unbalanced) measures with at most $n$ supports. We first prove that we can obtain two equivalence forms of the multimarginal POT p…
Multimarginal flow matching with optimal transport potentials
Flow matching (FM) has emerged as a powerful framework for learning dynamic transport maps between two empirical distributions. However, less explored is the setting with intermediate observed marginals that can help con…
Fast computation of the TGOSPA metric for multiple target tracking via unbalanced optimal transport
In multiple target tracking, it is important to be able to evaluate the performance of different tracking algorithms. The trajectory generalized optimal sub-pattern assignment metric (TGOSPA) is a recently proposed metri…
Convergence of Batch Greenkhorn for Regularized Multimarginal Optimal Transport
In this work we propose a batch version of the Greenkhorn algorithm for multimarginal regularized optimal transport problems. Our framework is general enough to cover, as particular cases, some existing algorithms like S…
Matching on Balanced Nonlinear Representations for Treatment Effects Estimation
Estimating treatment effects from observational data is challenging due to the missing counterfactuals. Matching is an effective strategy to tackle this problem. The widely used matching estimators such as nearest neighb…
counterfactualDomain Adaptation