Partial Identification under High-Dimensional Potential Outcomes and Confounders via Optimal Transport
Yunfeng Wang, Zhiheng Zhang, Zijun Gao
Abstract
Partial identification provides informative causal guarantees when point identification is impossible, but existing approaches based on optimal transport (OT) become computationally and statistically intractable in high-dimensional settings. This limitation is particularly severe when both potential outcomes and confounders are high-dimensional, where classical OT-based bounds suffer from the curse of dimensionality and unfavorable convergence rates. To address this challenge, we propose a novel estimator that decomposes the transport problem into a low-dimensional signal subspace and a high-dimensional residual subspace. Unlike existing projection-based methods that discard residual information, we recover the residual transport energy using the Sliced Wasserstein distance, which is computationally efficient and robust to high dimensions. We establish interpretable conditions controlling the approximation gap based on residual structure and provide a data-driven rule for signal dimension selection. Empirical results show that our estimator consistently outperforms projection-only baselines by recovering lost transport energy, yielding more informative causal bounds while remaining computationally tractable in high dimensions.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Builds on4
- Projection Robust Wasserstein Distance and Riemannian OptimizationTianyi Lin, Chenyou Fan, Nhat Ho, Marco Cuturi et al.NeurIPS 2020 · 84 citations
- A Riemannian Block Coordinate Descent Method for Computing the Projection Robust Wasserstein DistanceMinhui Huang, Shiqian Ma, Lifeng LaiICML 2021 · 45 citations
- Tight Partial Identification of Causal Effects with Marginal Distribution of Unmeasured ConfoundersZhiheng ZhangICML 2024 · 1 citation
- Tightening Causal Bounds via Covariate-Aware Optimal TransportSirui Lin, Zijun Gao, Jose H. Blanchet, Peter W. GlynnICML 2025
Related papers
- Spiked-CFR: Causal Representation Learning from LLMs via Wasserstein Projection PursuitFan Wang, Hengyu Yue, Yu Bowen, Weiming Liu et al.ICML 2026
- One for all and all for one: Efficient computation of partial Wasserstein distances on the lineLaetitia Chapel, Romain TavenardICLR 2025
- Optimal Transport for Structure Learning Under Missing DataVy Vo, He Zhao, Trung Le, Edwin V. Bonilla et al.ICML 2024 · 6 citations
- Optimal Transport for Treatment Effect EstimationHao Wang, Jiajun Fan, Zhichao Chen, Haoxuan Li et al.NeurIPS 2023 · 71 citations
- Statistical, Robustness, and Computational Guarantees for Sliced Wasserstein DistancesSloan Nietert, Ziv Goldfeld, Ritwik Sadhu, Kengo KatoNeurIPS 2022 · 73 citations
