Revisiting Counterfactual Regression through the Lens of Gromov-Wasserstein Information Bottleneck
Hao Yang, Zexu Sun, Hongteng Xu, Xu Chen

TL;DR
This paper introduces Gromov-Wasserstein Information Bottleneck (GWIB), a novel approach for counterfactual regression that reduces selection bias and improves individualized treatment effect estimation by leveraging optimal transport and information theory.
Contribution
The paper proposes GWIB, a new learning paradigm that combines Gromov-Wasserstein distance with information bottleneck principles to enhance counterfactual regression performance.
Findings
GWIB outperforms existing CFR methods on ITE estimation tasks.
The method effectively suppresses selection bias in latent representations.
GWIB maintains diverse latent distributions without collapsing to trivial solutions.
Abstract
As a promising individualized treatment effect (ITE) estimation method, counterfactual regression (CFR) maps individuals' covariates to a latent space and predicts their counterfactual outcomes. However, the selection bias between control and treatment groups often imbalances the two groups' latent distributions and negatively impacts this method's performance. In this study, we revisit counterfactual regression through the lens of information bottleneck and propose a novel learning paradigm called Gromov-Wasserstein information bottleneck (GWIB). In this paradigm, we learn CFR by maximizing the mutual information between covariates' latent representations and outcomes while penalizing the kernelized mutual information between the latent representations and the covariates. We demonstrate that the upper bound of the penalty term can be implemented as a new regularizer consisting of …
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdversarial Robustness in Machine Learning
