Multiple Instance Learning for Uplift Modeling

• URL: http://arxiv.org/abs/2312.09639v1
• Date: Fri, 15 Dec 2023 09:28:40 GMT
• Title: Multiple Instance Learning for Uplift Modeling
• Abstract summary: 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.
• Score: 46.1924474929763
• License: http://creativecommons.org/licenses/by-nc-nd/4.0/
• Abstract: Uplift modeling is widely used in performance marketing to estimate effects of promotion campaigns (e.g., increase of customer retention rate). Since it is impossible to observe outcomes of a recipient in treatment (e.g., receiving a certain promotion) and control (e.g., without promotion) groups simultaneously (i.e., counter-factual), uplift models are mainly trained on instances of treatment and control groups separately to form two models respectively, and uplifts are predicted by the difference of predictions from these two models (i.e., two-model method). When responses are noisy and the treatment effect is fractional, induced individual uplift predictions will be inaccurate, resulting in targeting undesirable customers. Though it is impossible to obtain the ideal ground-truth individual uplifts, known as Individual Treatment Effects (ITEs), alternatively, an average uplift of a group of users, called Average Treatment Effect (ATE), can be observed from experimental deliveries. Upon this, similar to Multiple Instance Learning (MIL) in which each training sample is a bag of instances, 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, thus learning more accurate individual uplifts. Additionally, to amplify the fractional treatment effect, bags are composed of instances with adjacent individual uplift predictions, instead of random instances. Experiments conducted on two datasets show the effectiveness and universality of the proposed framework.

Related papers

• Detecting and Mitigating Group Bias in Heterogeneous Treatment Effects [28.4891545570248]
  We develop a statistical framework to detect and mitigate group bias in randomized experiments.<n>For mitigation, we propose a shrinkage-based bias-correction, and show that the theoretically optimal and empirically feasible solutions have closed-form expressions.<n>We analyze the economic implications of mitigating detected group bias for profit-maximizing personalized targeting.
  arXiv  Detail & Related papers  (2026-02-23T21:47:01Z)
• GUDA: Counterfactual Group-wise Training Data Attribution for Diffusion Models via Unlearning [83.56510119503267]
  Group-wise attribution is counterfactual: how would a model's behavior on a generated sample change if a group were absent from training?<n>We propose GUDA (Group Unlearning-based Data Attribution) for diffusion models, which approximates each counterfactual model by applying machine unlearning to a shared full-data model instead of training from scratch.
  arXiv  Detail & Related papers  (2026-01-30T07:10:59Z)
• Identifying counterfactual probabilities using bivariate distributions and uplift modeling [1.519321208145928]
  Uplift modeling estimates the causal effect of an intervention as the difference between potential outcomes under treatment and control.<n>Counterfactual identification aims to recover the joint distribution of these potential outcomes.
  arXiv  Detail & Related papers  (2025-12-09T16:59:38Z)
• Conv4Rec: A 1-by-1 Convolutional AutoEncoder for User Profiling through Joint Analysis of Implicit and Explicit Feedbacks [35.7275102787435]
  We introduce a new convolutional AutoEncoder architecture for user modelling and recommendation tasks.<n>Our model is able to learn jointly from both the explicit ratings and the implicit information in the sampling pattern.<n>In experiments on several real-life datasets, we achieve state-of-the-art performance on both the implicit and explicit feedback prediction tasks.
  arXiv  Detail & Related papers  (2025-09-09T08:25:11Z)
• Whispers of Data: Unveiling Label Distributions in Federated Learning Through Virtual Client Simulation [4.81392127803963]
  Federated Learning enables collaborative training of a global model across multiple geographically dispersed clients without the need for data sharing. It is susceptible to inference attacks, particularly label inference attacks. We propose a novel label distribution inference attack that is stable and adaptable to various scenarios.
  arXiv  Detail & Related papers  (2025-04-30T08:51:06Z)
• Test-Time Alignment via Hypothesis Reweighting [56.71167047381817]
  Large pretrained models often struggle with underspecified tasks. We propose a novel framework to address the challenge of aligning models to test-time user intent.
  arXiv  Detail & Related papers  (2024-12-11T23:02:26Z)
• Graph Neural Network with Two Uplift Estimators for Label-Scarcity Individual Uplift Modeling [30.16065210190575]
  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.
  arXiv  Detail & Related papers  (2024-03-11T07:51:27Z)
• Federated Two Stage Decoupling With Adaptive Personalization Layers [5.69361786082969]
  Federated learning has gained significant attention due to its ability to enable distributed learning while maintaining privacy constraints. It inherently experiences significant learning degradation and slow convergence speed. It is natural to employ the concept of clustering homogeneous clients into the same group, allowing only the model weights within each group to be aggregated.
  arXiv  Detail & Related papers  (2023-08-30T07:46:32Z)
• ASPEST: Bridging the Gap Between Active Learning and Selective Prediction [56.001808843574395]
  Selective prediction aims to learn a reliable model that abstains from making predictions when uncertain. Active learning aims to lower the overall labeling effort, and hence human dependence, by querying the most informative examples. In this work, we introduce a new learning paradigm, active selective prediction, which aims to query more informative samples from the shifted target domain.
  arXiv  Detail & Related papers  (2023-04-07T23:51:07Z)
• KDSM: An uplift modeling framework based on knowledge distillation and sample matching [2.036924568983982]
  Uplift modeling aims to estimate the treatment effect on individuals. Tree-based methods are adept at fitting increment and generalization, while neural-network-based models excel at predicting absolute value and precision. In this paper, we proposed an uplift modeling framework based on Knowledge Distillation and Sample Matching (KDSM)
  arXiv  Detail & Related papers  (2023-03-06T09:15:28Z)
• Uplifting Bandits [23.262188897812475]
  We introduce a multi-armed bandit model where the reward is a sum of multiple random variables, and each action only alters the distributions of some of them. This model is motivated by marketing campaigns and recommender systems, where the variables represent outcomes on individual customers. We propose UCB-style algorithms that estimate the uplifts of the actions over a baseline.
  arXiv  Detail & Related papers  (2022-06-08T18:00:56Z)
• Cross Pairwise Ranking for Unbiased Item Recommendation [57.71258289870123]
  We develop a new learning paradigm named Cross Pairwise Ranking (CPR) CPR achieves unbiased recommendation without knowing the exposure mechanism. We prove in theory that this way offsets the influence of user/item propensity on the learning.
  arXiv  Detail & Related papers  (2022-04-26T09:20:27Z)
• Undersmoothing Causal Estimators with Generative Trees [0.0]
  Inferring individualised treatment effects from observational data can unlock the potential for targeted interventions. It is, however, hard to infer these effects from observational data. In this paper, we explore a novel generative tree based approach that tackles model misspecification directly.
  arXiv  Detail & Related papers  (2022-03-16T11:59:38Z)
• Test-time Collective Prediction [73.74982509510961]
  Multiple parties in machine learning want to jointly make predictions on future test points. Agents wish to benefit from the collective expertise of the full set of agents, but may not be willing to release their data or model parameters. We explore a decentralized mechanism to make collective predictions at test time, leveraging each agent's pre-trained model.
  arXiv  Detail & Related papers  (2021-06-22T18:29:58Z)
• Rethinking InfoNCE: How Many Negative Samples Do You Need? [54.146208195806636]
  We study how many negative samples are optimal for InfoNCE in different scenarios via a semi-quantitative theoretical framework. We estimate the optimal negative sampling ratio using the $K$ value that maximizes the training effectiveness function.
  arXiv  Detail & Related papers  (2021-05-27T08:38:29Z)
• Fine-Tuning Pretrained Language Models: Weight Initializations, Data Orders, and Early Stopping [62.78338049381917]
  Fine-tuning pretrained contextual word embedding models to supervised downstream tasks has become commonplace in natural language processing. We experiment with four datasets from the GLUE benchmark, fine-tuning BERT hundreds of times on each while varying only the random seeds. We find substantial performance increases compared to previously reported results, and we quantify how the performance of the best-found model varies as a function of the number of fine-tuning trials.
  arXiv  Detail & Related papers  (2020-02-15T02:40:10Z)

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.