paper-with-me

홈 › Papers

Learning Infomax and Domain-Independent Representations for Causal Effect Inference with Real-World Data

2022-02-22 · Zhixuan Chu, Stephen Rathbun, Sheng Li

The foremost challenge to causal inference with real-world data is to handle the imbalance in the covariates with respect to different treatment options, caused by treatment selection bias. To address this issue, recent literature has explored domain-invariant representation learning based on different domain divergence metrics (e.g., Wasserstein distance, maximum mean discrepancy, position-dependent metric, and domain overlap). In this paper, we reveal the weaknesses of these strategies, i.e., they lead to the loss of predictive information when enforcing the domain invariance; and the treatment effect estimation performance is unstable, which heavily relies on the characteristics of the domain distributions and the choice of domain divergence metrics. Motivated by information theory, we propose to learn the Infomax and Domain-Independent Representations to solve the above puzzles. Our method utilizes the mutual information between the global feature representations and individual feature representations, and the mutual information between feature representations and treatment assignment predictions, in order to maximally capture the common predictive information for both treatment and control groups. Moreover, our method filters out the influence of instrumental and irrelevant variables, and thus it effectively increases the predictive ability of potential outcomes. Experimental results on both the synthetic and real-world datasets show that our method achieves state-of-the-art performance on causal effect inference. Moreover, our method exhibits reliable prediction performances when facing data with different characteristics of data distributions, complicated variable types, and severe covariate imbalance.

📄 PDF Abstract BibTeX arXiv:2202.10885

Code (0)

등록된 구현이 없습니다.

Tasks

Causal InferenceRepresentation LearningSelection bias

Similar Papers 제목 키워드 기반

Discrete Infomax Codes for Supervised Representation Learning

2019-05-28 · Yoonho Lee, Wonjae Kim, Wonpyo Park, Seungjin Choi

Learning compact discrete representations of data is a key task on its own or for facilitating subsequent processing of data. In this paper we present a model that produces Discrete InfoMax Codes (DIMCO); we learn a prob…

Meta-LearningMetric LearningRepresentation LearningRetrieval

Efficient Distribution Matching of Representations via Noise-Injected Deep InfoMax

2024-10-09 · Ivan Butakov, Alexander Semenenko, Alexander Tolmachev, Andrey Gladkov 외

Deep InfoMax (DIM) is a well-established method for self-supervised representation learning (SSRL) based on maximization of the mutual information between the input and the output of a deep neural network encoder. Despit…

DisentanglementRepresentation Learning

Causal Contrastive Learning for Counterfactual Regression Over Time

2024-06-01 · Mouad El Bouchattaoui, Myriam Tami, Benoit Lepetit, Paul-Henry Cournède

Estimating treatment effects over time holds significance in various domains, including precision medicine, epidemiology, economy, and marketing. This paper introduces a unique approach to counterfactual regression over …

Causal InferenceContrastive LearningcounterfactualEpidemiology+2

Graph Infomax Adversarial Learning for Treatment Effect Estimation with Networked Observational Data

2021-06-05 · Zhixuan Chu, Stephen L. Rathbun, Sheng Li

Treatment effect estimation from observational data is a critical research topic across many domains. The foremost challenge in treatment effect estimation is how to capture hidden confounders. Recently, the growing avai…

Causal InferenceGraph LearningNode Classification

Domain Adaptive Graph Infomax via Conditional Adversarial Networks

2023-01-01 · IEEE Transactions on Network Science and Engineering 2023 1 · Jiaren Xiao, Quanyu Dai, Xiaochen Xie, Qi Dou 외

The emerging graph neural networks (GNNs) have demonstrated impressive performance on the node classification problem in complex networks. However, existing GNNs are mainly devised to classify nodes in a (partially) labe…

Node Classification