Rec4Ad: A Free Lunch to Mitigate Sample Selection Bias for Ads CTR Prediction in Taobao

• URL: http://arxiv.org/abs/2306.03527v1
• Date: Tue, 6 Jun 2023 09:22:52 GMT
• Title: Rec4Ad: A Free Lunch to Mitigate Sample Selection Bias for Ads CTR Prediction in Taobao
• Authors: Jingyue Gao, Shuguang Han, Han Zhu, Siran Yang, Yuning Jiang, Jian Xu, Bo Zheng
• Abstract summary: We propose to leverage recommendations samples as a free lunch to mitigate sample selection bias for ads CTR model (Rec4Ad) Rec4Ad achieves substantial gains in key business metrics, with a lift of up to +6.6% CTR and +2.9% RPM.
• Score: 24.43583745735832
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Click-Through Rate (CTR) prediction serves as a fundamental component in online advertising. A common practice is to train a CTR model on advertisement (ad) impressions with user feedback. Since ad impressions are purposely selected by the model itself, their distribution differs from the inference distribution and thus exhibits sample selection bias (SSB) that affects model performance. Existing studies on SSB mainly employ sample re-weighting techniques which suffer from high variance and poor model calibration. Another line of work relies on costly uniform data that is inadequate to train industrial models. Thus mitigating SSB in industrial models with a uniform-data-free framework is worth exploring. Fortunately, many platforms display mixed results of organic items (i.e., recommendations) and sponsored items (i.e., ads) to users, where impressions of ads and recommendations are selected by different systems but share the same user decision rationales. Based on the above characteristics, we propose to leverage recommendations samples as a free lunch to mitigate SSB for ads CTR model (Rec4Ad). After elaborating data augmentation, Rec4Ad learns disentangled representations with alignment and decorrelation modules for enhancement. When deployed in Taobao display advertising system, Rec4Ad achieves substantial gains in key business metrics, with a lift of up to +6.6\% CTR and +2.9\% RPM.

Related papers

• Unbiased Filtering Of Accidental Clicks in Verizon Media Native Advertising [1.6717433307723157]
  We focus on the challenge of predicting click-through rates (CTR) when we are aware that some of the clicks have short dwell-time. An accidental click implies little affinity between the user and the ad, so predicting that similar users will click on the ad is inaccurate. We present a new approach where the positive weight of the accidental clicks is distributed among all of the negative events (skips), based on their likelihood of causing accidental clicks.
  arXiv  Detail & Related papers  (2023-12-08T12:54:30Z)
• Improving a Named Entity Recognizer Trained on Noisy Data with a Few Clean Instances [55.37242480995541]
  We propose to denoise noisy NER data with guidance from a small set of clean instances. Along with the main NER model we train a discriminator model and use its outputs to recalibrate the sample weights. Results on public crowdsourcing and distant supervision datasets show that the proposed method can consistently improve performance with a small guidance set.
  arXiv  Detail & Related papers  (2023-10-25T17:23:37Z)
• COPR: Consistency-Oriented Pre-Ranking for Online Advertising [27.28920707332434]
  We introduce a consistency-oriented pre-ranking framework for online advertising. It employs a chunk-based sampling module and a plug-and-play rank alignment module to explicitly optimize consistency of ECPM-ranked results. When deployed in Taobao display advertising system, it achieves an improvement of up to +12.3% CTR and +5.6% RPM.
  arXiv  Detail & Related papers  (2023-06-06T09:08:40Z)
• Selecting Learnable Training Samples is All DETRs Need in Crowded Pedestrian Detection [72.97320260601347]
  In crowded pedestrian detection, the performance of DETRs is still unsatisfactory due to the inappropriate sample selection method. We propose Sample Selection for Crowded Pedestrians, which consists of the constraint-guided label assignment scheme (CGLA) Experimental results show that the proposed SSCP effectively improves the baselines without introducing any overhead in inference.
  arXiv  Detail & Related papers  (2023-05-18T08:28:01Z)
• Towards Robust Visual Question Answering: Making the Most of Biased Samples via Contrastive Learning [54.61762276179205]
  We propose a novel contrastive learning approach, MMBS, for building robust VQA models by Making the Most of Biased Samples. Specifically, we construct positive samples for contrastive learning by eliminating the information related to spurious correlation from the original training samples. We validate our contributions by achieving competitive performance on the OOD dataset VQA-CP v2 while preserving robust performance on the ID dataset VQA v2.
  arXiv  Detail & Related papers  (2022-10-10T11:05:21Z)
• Rethinking Position Bias Modeling with Knowledge Distillation for CTR Prediction [8.414183573280779]
  This work proposes a knowledge distillation framework to alleviate the impact of position bias and leverage position information to improve CTR prediction. The proposed method has been deployed in the real world online ads systems, serving main traffic on one of the world's largest e-commercial platforms.
  arXiv  Detail & Related papers  (2022-04-01T07:58:38Z)
• CausalMTA: Eliminating the User Confounding Bias for Causal Multi-touch Attribution [16.854552780506822]
  We propose CausalMTA to eliminate the influence of user preferences. CaulMTA achieves better prediction performance than the state-of-the-art method. It also generates meaningful attribution credits across different advertising channels.
  arXiv  Detail & Related papers  (2021-12-21T01:59:16Z)
• 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)
• Probabilistic and Variational Recommendation Denoising [56.879165033014026]
  Learning from implicit feedback is one of the most common cases in the application of recommender systems. We propose probabilistic and variational recommendation denoising for implicit feedback. We employ the proposed DPI and DVAE on four state-of-the-art recommendation models and conduct experiments on three datasets.
  arXiv  Detail & Related papers  (2021-05-20T08:59:44Z)
• One for More: Selecting Generalizable Samples for Generalizable ReID Model [92.40951770273972]
  This paper proposes a one-for-more training objective that takes the generalization ability of selected samples as a loss function. Our proposed one-for-more based sampler can be seamlessly integrated into the ReID training framework.
  arXiv  Detail & Related papers  (2020-12-10T06:37:09Z)
• Learning Classifiers under Delayed Feedback with a Time Window Assumption [16.269923100433235]
  We consider training a binary classifier under delayed feedback (emphDF learning) We initially receive negative samples; subsequently, some samples among them change to positive. Owing to the delayed feedback, naive classification of the positive and negative samples returns a biased classifier.
  arXiv  Detail & Related papers  (2020-09-28T06:20:24Z)

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.