mlsanityData to 14 Oct 2026

Graph Neural Network with Two Uplift Estimators for Label-Scarcity Individual Uplift Modeling

arXiv 2403.06489 ↗First posted 11 Mar 2024cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

Uplift modeling aims to measure the incremental effect, which we call uplift, of a strategy or action on the users from randomized experiments or observational data. Most existing uplift methods only use individual data, which are usually not informative enough to capture the unobserved and complex hidden factors regarding the uplift. Furthermore, uplift modeling scenario usually has scarce labeled data, especially for the treatment group, which also poses a great challenge for model training. Considering that the neighbors' features and the social relationships are very informative to characterize a user's uplift, we propose a graph neural network-based framework with two uplift estimators, called GNUM, to learn from the social graph for uplift estimation. Specifically, we design the first estimator based on a class-transformed target. The estimator is general for all types of outcomes, and is able to comprehensively model the treatment and control group data together to approach the uplift. When the outcome is discrete, we further design the other uplift estimator based on our defined partial labels, which is able to utilize more labeled data from both the treatment and control groups, to further alleviate the label scarcity problem. Comprehensive experiments on a public dataset and two industrial datasets show a superior performance of our proposed framework over state-of-the-art methods under various evaluation metrics. The proposed algorithms have been deployed online to serve real-world uplift estimation scenarios.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 19 of its 61 references that are in the map. First posted on arXiv 11 Mar 2024.

Builds on

19 of 61 references.

References · 19

  1. 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
  2. 2017Inductive Representation Learning on Large Graphscited by 6,320
  3. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,166
  4. 2017Neural Message Passing for Quantum Chemistrycited by 3,487
  5. 2016Convolutional Neural Networks on Graphs with Fast Localized Spectral Filteringcited by 2,089
  6. 2013Spectral Networks and Locally Connected Networks on Graphscited by 1,102
  7. 2016Geometric deep learning: going beyond Euclidean datacited by 1,048
  8. 2017Causal Effect Inference with Deep Latent-Variable Modelscited by 410
  9. 2018Deep Learning on Graphs: A Surveycited by 393
  10. 2015A Light CNN for Deep Face Representation with Noisy Labelscited by 126
  11. 2021Causal Attention for Interpretable and Generalizable Graph Classificationcited by 108
  12. 2018GeniePath: Graph Neural Networks with Adaptive Receptive Pathscited by 66
7 more
  1. 2019Learning Individual Causal Effects from Networked Observational Datacited by 56
  2. 2019Using Embeddings to Correct for Unobserved Confounding in Networkscited by 31
  3. 2022Learning Causal Effects on Hypergraphscited by 31
  4. 2020Should Graph Convolution Trust Neighbors? A Simple Causal Inference Methodcited by 25
  5. 2019A Regularization Approach for Instance-Based Superset Label Learningcited by 21
  6. 2021Causal Incremental Graph Convolution for Recommender System Retrainingcited by 14
  7. 2019Counterfactual Evaluation of Treatment Assignment Functions with Networked Observational Datacited by 7

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2024: 1; 2025: 0; 2026: 1.

2 papers.