mlsanityData to 14 Oct 2026

The Evolution of Embedding Table Optimization and Multi-Epoch Training in Pinterest Ads Conversion

arXiv 2505.05605 ↗First posted 8 May 2025cs.LG cs.CE cs.IRcited by 3

Not on the map. Why?

Abstract (arXiv)

Deep learning for conversion prediction has found widespread applications in online advertising. These models have become more complex as they are trained to jointly predict multiple objectives such as click, add-to-cart, checkout and other conversion types. Additionally, the capacity and performance of these models can often be increased with the use of embedding tables that encode high cardinality categorical features such as advertiser, user, campaign, and product identifiers (IDs). These embedding tables can be pre-trained, but also learned end-to-end jointly with the model to directly optimize the model objectives. Training these large tables is challenging due to: gradient sparsity, the high cardinality of the categorical features, the non-uniform distribution of IDs and the very high label sparsity. These issues make training prone to both slow convergence and overfitting after the first epoch. Previous works addressed the multi-epoch overfitting issue by using: stronger feature hashing to reduce cardinality, filtering of low frequency IDs, regularization of the embedding tables, re-initialization of the embedding tables after each epoch, etc. Some of these techniques reduce overfitting at the expense of reduced model performance if used too aggressively. In this paper, we share key learnings from the development of embedding table optimization and multi-epoch training in Pinterest Ads Conversion models. We showcase how our Sparse Optimizer speeds up convergence, and how multi-epoch overfitting varies in severity between different objectives in a multi-task model depending on label sparsity. We propose a new approach to deal with multi-epoch overfitting: the use of a frequency-adaptive learning rate on the embedding tables and compare it to embedding re-initialization. We evaluate both methods offline using an industrial large-scale production dataset.

Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 17 of its 33 references that are in the map. First posted on arXiv 8 May 2025.

Builds on

17 of 33 references.

References · 17

  1. 2017Attention Is All You Needcited by 60,361
  2. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  3. 2020Prevalence of Neural Collapse during the terminal phase of deep learning trainingcited by 719
  4. 2020DCN V2: Improved Deep & Cross Network and Practical Lessons for Web-scale Learning to Rank Systemscited by 327
  5. 2018AutoInt: Automatic Feature Interaction Learning via Self-Attentive Neural Networkscited by 320
  6. 2022Extended Unconstrained Features Model for Exploring Deep Neural Collapsecited by 102
  7. 2017Hash Embeddings for Efficient Word Representationscited by 55
  8. 2021MaskNet: Introducing Feature-Wise Multiplication to CTR Ranking Models by Instance-Guided Maskcited by 48
  9. 2023FinalMLP: An Enhanced Two-Stream MLP Model for CTR Predictioncited by 37
  10. 2020Model Size Reduction Using Frequency Based Double Hashing for Recommender Systemscited by 33
  11. 2022Towards Understanding the Overfitting Phenomenon of Deep Click-Through Rate Prediction Modelscited by 33
  12. 2023Multi-Task Deep Recommender Systems: A Surveycited by 30
5 more
  1. 2023On the Embedding Collapse when Scaling up Recommendation Modelscited by 29
  2. 2022Alleviating Cold-start Problem in CTR Prediction with A Variational Embedding Learning Frameworkcited by 13
  3. 2023Rec4Ad: A Free Lunch to Mitigate Sample Selection Bias for Ads CTR Prediction in Taobaocited by 11
  4. 2022FiBiNet++: Reducing Model Size by Low Rank Feature Interaction Layer for CTR Predictioncited by 8
  5. 2021Frequency-aware SGD for Efficient Embedding Learning with Provable Benefitscited by 6

Built on by

Cited by year (2026 to 14 Oct)

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

3 papers.