mlsanityData to 7 Oct 2026

Improving conversion rate prediction via self-supervised pre-training in online advertising

arXiv 2401.16432 ↗First posted 25 Jan 2024cs.IR cs.LG stat.MLcited by 2

Not on the map. Why?

Abstract (arXiv)

The task of predicting conversion rates (CVR) lies at the heart of online advertising systems aiming to optimize bids to meet advertiser performance requirements. Even with the recent rise of deep neural networks, these predictions are often made by factorization machines (FM), especially in commercial settings where inference latency is key. These models are trained using the logistic regression framework on labeled tabular data formed from past user activity that is relevant to the task at hand. Many advertisers only care about click-attributed conversions. A major challenge in training models that predict conversions-given-clicks comes from data sparsity - clicks are rare, conversions attributed to clicks are even rarer. However, mitigating sparsity by adding conversions that are not click-attributed to the training set impairs model calibration. Since calibration is critical to achieving advertiser goals, this is infeasible. In this work we use the well-known idea of self-supervised pre-training, and use an auxiliary auto-encoder model trained on all conversion events, both click-attributed and not, as a feature extractor to enrich the main CVR prediction model. Since the main model does not train on non click-attributed conversions, this does not impair calibration. We adapt the basic self-supervised pre-training idea to our online advertising setup by using a loss function designed for tabular data, facilitating continual learning by ensuring auto-encoder stability, and incorporating a neural network into a large-scale real-time ad auction that ranks tens of thousands of ads, under strict latency constraints, and without incurring a major engineering cost. We show improvements both offline, during training, and in an online A/B test. Following its success in A/B tests, our solution is now fully deployed to the Yahoo native advertising system.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 17 of its 37 references that are in the map. First posted on arXiv 25 Jan 2024.

Builds on

17 of 37 references.

References · 17

  1. 2017Attention Is All You Needcited by 59,932
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  3. 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,462
  4. 2021Barlow Twins: Self-Supervised Learning via Redundancy Reductioncited by 1,818
  5. 2019BERT4Rec: Sequential Recommendation with Bidirectional Encoder Representations from Transformercited by 952
  6. 2018Learning and Generalization in Overparameterized Neural Networks, Going Beyond Two Layerscited by 340
  7. 2020S^3-Rec: Self-Supervised Learning for Sequential Recommendation with Mutual Information Maximizationcited by 311
  8. 2015MADE: Masked Autoencoder for Distribution Estimationcited by 306
  9. 2018Stronger generalization bounds for deep nets via a compression approachcited by 306
  10. 2018CoNet: Collaborative Cross Networks for Cross-Domain Recommendationcited by 81
  11. 2014On the Computational Efficiency of Training Neural Networkscited by 71
  12. 2020How to Retrain Recommender System? A Sequential Meta-Learning Methodcited by 42
5 more
  1. 2019DARec: Deep Domain Adaptation for Cross-Domain Recommendation via Transferring Rating Patternscited by 33
  2. 2018Perceive Your Users in Depth: Learning Universal User Representations from Multiple E-commerce Taskscited by 24
  3. 2022KEEP: An Industrial Pre-Training Framework for Online Recommendation via Knowledge Extraction and Pluggingcited by 11
  4. 2013OFF-Set: One-pass Factorization of Feature Sets for Online Recommendation in Persistent Cold Start Settingscited by 8
  5. 2023Soft Frequency Capping for Improved Ad Click Prediction in Yahoo Gemini Nativecited by 2

Built on by

Cited by year (2026 to 7 Oct)

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

2 papers.