Soft Frequency Capping for Improved Ad Click Prediction in Yahoo Gemini Native

• URL: http://arxiv.org/abs/2312.05052v1
• Date: Fri, 8 Dec 2023 14:12:49 GMT
• Title: Soft Frequency Capping for Improved Ad Click Prediction in Yahoo Gemini Native
• Authors: Michal Aharon and Yohay Kaplan and Rina Levy and Oren Somekh and Ayelet Blanc and Neetai Eshel and Avi Shahar and Assaf Singer and Alex Zlotnik
• Abstract summary: Yahoo's native advertising (also known as Gemini native) serves billions of ad impressions daily, reaching a yearly run-rate of many hundred of millions USD. Offset is a one-pass algorithm that updates its model for every new batch of logged data using a gradient descent (SGD) based approach. We propose a soft frequency capping (SFC) approach, where the frequency feature is incorporated into the OFFSET model as a user-ad feature and its weight vector is learned via logistic regression.
• Score: 1.9315883475944244
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Yahoo's native advertising (also known as Gemini native) serves billions of ad impressions daily, reaching a yearly run-rate of many hundred of millions USD. Driving the Gemini native models that are used to predict both click probability (pCTR) and conversion probability (pCONV) is OFFSET - a feature enhanced collaborative-filtering (CF) based event prediction algorithm. \offset is a one-pass algorithm that updates its model for every new batch of logged data using a stochastic gradient descent (SGD) based approach. Since OFFSET represents its users by their features (i.e., user-less model) due to sparsity issues, rule based hard frequency capping (HFC) is used to control the number of times a certain user views a certain ad. Moreover, related statistics reveal that user ad fatigue results in a dramatic drop in click through rate (CTR). Therefore, to improve click prediction accuracy, we propose a soft frequency capping (SFC) approach, where the frequency feature is incorporated into the OFFSET model as a user-ad feature and its weight vector is learned via logistic regression as part of OFFSET training. Online evaluation of the soft frequency capping algorithm via bucket testing showed a significant 7.3% revenue lift. Since then, the frequency feature enhanced model has been pushed to production serving all traffic, and is generating a hefty revenue lift for Yahoo Gemini native. We also report related statistics that reveal, among other things, that while users' gender does not affect ad fatigue, the latter seems to increase with users' age.

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)
• Robust Collaborative Filtering to Popularity Distribution Shift [56.78171423428719]
  We present a simple yet effective debiasing strategy, PopGo, which quantifies and reduces the interaction-wise popularity shortcut without assumptions on the test data. On both ID and OOD test sets, PopGo achieves significant gains over the state-of-the-art debiasing strategies.
  arXiv  Detail & Related papers  (2023-10-16T04:20:52Z)
• Prune Spatio-temporal Tokens by Semantic-aware Temporal Accumulation [89.88214896713846]
  STA score considers two critical factors: temporal redundancy and semantic importance. We apply the STA module to off-the-shelf video Transformers and Videowins. Results: Kinetics-400 and Something-Something V2 achieve 30% overshelf reduction with a negligible 0.2% accuracy drop.
  arXiv  Detail & Related papers  (2023-08-08T19:38:15Z)
• Click-Conversion Multi-Task Model with Position Bias Mitigation for Sponsored Search in eCommerce [51.211924408864355]
  We propose two position-bias-free prediction models: Position-Aware Click-Conversion (PACC) and PACC via Position Embedding (PACC-PE) Experiments on the E-commerce sponsored product search dataset show that our proposed models have better ranking effectiveness and can greatly alleviate position bias in both CTR and CVR prediction.
  arXiv  Detail & Related papers  (2023-07-29T19:41:16Z)
• FE-TCM: Filter-Enhanced Transformer Click Model for Web Search [10.91456636784484]
  We use Transformer as the backbone network of feature extraction, add filter layer innovatively, and propose a new Filter-Enhanced Transformer Click Model (FE-TCM) for web search. FE-TCM outperforms the existing click models for the click prediction.
  arXiv  Detail & Related papers  (2023-01-19T02:51:47Z)
• Profiling Television Watching Behaviour Using Bayesian Hierarchical Joint Models for Time-to-Event and Count Data [9.33192719245965]
  We propose a novel Bayesian hierarchical joint model that characterises customer profiles based on how many events take place within different television watching journeys. The model drastically reduces the dimensionality of the data from thousands of observations per customer to 11 customer-level parameter estimates and random effects. Our proposed methodology represents an efficient way of reducing the dimensionality of the data, while at the same time maintaining high descriptive and predictive capabilities.
  arXiv  Detail & Related papers  (2022-09-06T16:29:15Z)
• Meta-Wrapper: Differentiable Wrapping Operator for User Interest Selection in CTR Prediction [97.99938802797377]
  Click-through rate (CTR) prediction, whose goal is to predict the probability of the user to click on an item, has become increasingly significant in recommender systems. Recent deep learning models with the ability to automatically extract the user interest from his/her behaviors have achieved great success. We propose a novel approach under the framework of the wrapper method, which is named Meta-Wrapper.
  arXiv  Detail & Related papers  (2022-06-28T03:28:15Z)
• 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)
• Less is More: Sparse Sampling for Dense Reaction Predictions [60.005266111509435]
  We present our method for 2021 Evoked Expression from Videos Challenge. Our model utilizes both audio and image modalities as inputs to predict emotion changes of viewers. The proposed method has achieved pearson's correlation score of 0.04430 on the final private test set.
  arXiv  Detail & Related papers  (2021-06-03T11:33:59Z)
• SLOE: A Faster Method for Statistical Inference in High-Dimensional Logistic Regression [68.66245730450915]
  We develop an improved method for debiasing predictions and estimating frequentist uncertainty for practical datasets. Our main contribution is SLOE, an estimator of the signal strength with convergence guarantees that reduces the computation time of estimation and inference by orders of magnitude.
  arXiv  Detail & Related papers  (2021-03-23T17:48:56Z)
• Capturing Delayed Feedback in Conversion Rate Prediction via Elapsed-Time Sampling [29.77426549280091]
  Conversion rate (CVR) prediction is one of the most critical tasks for digital display advertising. We propose Elapsed-Time Sampling Delayed Feedback Model (ES-DFM), which models the relationship between the observed conversion distribution and the true conversion distribution.
  arXiv  Detail & Related papers  (2020-12-06T12:20: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.