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

• URL: http://arxiv.org/abs/2403.06489v1
• Date: Mon, 11 Mar 2024 07:51:27 GMT
• Title: Graph Neural Network with Two Uplift Estimators for Label-Scarcity Individual Uplift Modeling
• Abstract summary: We propose a graph neural network-based framework with two uplift estimators, calledM, to learn from the social graph for uplift estimation. The proposed algorithms have been deployed online to serve real-world uplift estimation scenarios.
• Score: 30.16065210190575
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: 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.

Related papers

• Structuring and Tokenizing Distributed User Interest Context for Generative Recommendation [60.03046892817763]
  Generative recommendation is an emerging paradigm that has shown promise in industrial recommendation systems.<n>Existing methods often struggle to organize and inject complex user-behavioral and item-semantic contexts into recommendation models simultaneously.<n>We propose G2Rec, a scalable framework that unifies holistic graph-based user co-engagement modeling with semantic tokenization for industrial-scale generative recommendation.
  arXiv  Detail & Related papers  (2026-06-18T17:58:32Z)
• Graph Contrastive Learning on Multi-label Classification for Recommendations [34.785207813971134]
  We propose a model called Graph Contrastive Learning for Multi-label Classification (MCGCL) MCGCL leverages contrastive learning to enhance recommendation effectiveness. We assess the performance using real-world datasets from Amazon Reviews in multi-label classification tasks.
  arXiv  Detail & Related papers  (2025-01-13T00:29:29Z)
• An Automatic Graph Construction Framework based on Large Language Models for Recommendation [49.51799417575638]
  We introduce AutoGraph, an automatic graph construction framework based on large language models for recommendation. LLMs infer the user preference and item knowledge, which is encoded as semantic vectors. Latent factors are incorporated as extra nodes to link the user/item nodes, resulting in a graph with in-depth global-view semantics.
  arXiv  Detail & Related papers  (2024-12-24T07:51:29Z)
• Scaling Laws for the Value of Individual Data Points in Machine Learning [55.596413470429475]
  We introduce a new perspective by investigating scaling behavior for the value of individual data points. We provide learning theory to support our scaling law, and we observe empirically that it holds across diverse model classes. Our work represents a first step towards understanding and utilizing scaling properties for the value of individual data points.
  arXiv  Detail & Related papers  (2024-05-30T20:10:24Z)
• Multiple Instance Learning for Uplift Modeling [46.1924474929763]
  Uplift modeling is widely used in performance marketing to estimate effects of promotion campaigns. Our framework sums up individual user uplift predictions for each bag of users as its bag-wise ATE prediction, and regularizes it to its ATE label. Experiments conducted on two datasets show the effectiveness and universality of the proposed framework.
  arXiv  Detail & Related papers  (2023-12-15T09:28:40Z)
• Uplift Modeling based on Graph Neural Network Combined with Causal Knowledge [9.005051998738134]
  We propose a framework based on graph neural networks that combine causal knowledge with an estimate of uplift value. Our findings demonstrate that this method works effectively for predicting uplift values, with small errors in typical simulated data.
  arXiv  Detail & Related papers  (2023-11-14T07:21:00Z)
• Combining Public Human Activity Recognition Datasets to Mitigate Labeled Data Scarcity [1.274578243851308]
  We propose a novel strategy to combine publicly available datasets with the goal of learning a generalized HAR model. Our experimental evaluation, which includes experimenting with different state-of-the-art neural network architectures, shows that combining public datasets can significantly reduce the number of labeled samples.
  arXiv  Detail & Related papers  (2023-06-23T18:51:22Z)
• Activity-aware Human Mobility Prediction with Hierarchical Graph Attention Recurrent Network [6.8500997328311]
  We present Hierarchical Graph Attention Recurrent Network (HGARN) for human mobility prediction. Specifically, we construct a hierarchical graph based on all users' history mobility records. We employ a Hierarchical Graph Attention Module to capture complex time-activity-location dependencies.
  arXiv  Detail & Related papers  (2022-10-14T12:56:01Z)
• Ordinal Graph Gamma Belief Network for Social Recommender Systems [54.9487910312535]
  We develop a hierarchical Bayesian model termed ordinal graph factor analysis (OGFA), which jointly models user-item and user-user interactions. OGFA not only achieves good recommendation performance, but also extracts interpretable latent factors corresponding to representative user preferences. We extend OGFA to ordinal graph gamma belief network, which is a multi-stochastic-layer deep probabilistic model.
  arXiv  Detail & Related papers  (2022-09-12T09:19:22Z)
• Towards Open-World Feature Extrapolation: An Inductive Graph Learning Approach [80.8446673089281]
  We propose a new learning paradigm with graph representation and learning. Our framework contains two modules: 1) a backbone network (e.g., feedforward neural nets) as a lower model takes features as input and outputs predicted labels; 2) a graph neural network as an upper model learns to extrapolate embeddings for new features via message passing over a feature-data graph built from observed data.
  arXiv  Detail & Related papers  (2021-10-09T09:02:45Z)
• From Canonical Correlation Analysis to Self-supervised Graph Neural Networks [99.44881722969046]
  We introduce a conceptually simple yet effective model for self-supervised representation learning with graph data. We optimize an innovative feature-level objective inspired by classical Canonical Correlation Analysis. Our method performs competitively on seven public graph datasets.
  arXiv  Detail & Related papers  (2021-06-23T15:55:47Z)
• Visual Distant Supervision for Scene Graph Generation [66.10579690929623]
  Scene graph models usually require supervised learning on large quantities of labeled data with intensive human annotation. We propose visual distant supervision, a novel paradigm of visual relation learning, which can train scene graph models without any human-labeled data. Comprehensive experimental results show that our distantly supervised model outperforms strong weakly supervised and semi-supervised baselines.
  arXiv  Detail & Related papers  (2021-03-29T06:35:24Z)
• Semi-Automatic Data Annotation guided by Feature Space Projection [117.9296191012968]
  We present a semi-automatic data annotation approach based on suitable feature space projection and semi-supervised label estimation. We validate our method on the popular MNIST dataset and on images of human intestinal parasites with and without fecal impurities. Our results demonstrate the added-value of visual analytics tools that combine complementary abilities of humans and machines for more effective machine learning.
  arXiv  Detail & Related papers  (2020-07-27T17:03:50Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.