Multi-Epoch Learning for Deep Click-Through Rate Prediction Models
Not on the map. Why?
Abstract (arXiv)
The one-epoch overfitting phenomenon has been widely observed in industrial Click-Through Rate (CTR) applications, where the model performance experiences a significant degradation at the beginning of the second epoch. Recent advances try to understand the underlying factors behind this phenomenon through extensive experiments. However, it is still unknown whether a multi-epoch training paradigm could achieve better results, as the best performance is usually achieved by one-epoch training. In this paper, we hypothesize that the emergence of this phenomenon may be attributed to the susceptibility of the embedding layer to overfitting, which can stem from the high-dimensional sparsity of data. To maintain feature sparsity while simultaneously avoiding overfitting of embeddings, we propose a novel Multi-Epoch learning with Data Augmentation (MEDA), which can be directly applied to most deep CTR models. MEDA achieves data augmentation by reinitializing the embedding layer in each epoch, thereby avoiding embedding overfitting and simultaneously improving convergence. To our best knowledge, MEDA is the first multi-epoch training paradigm designed for deep CTR prediction models. We conduct extensive experiments on several public datasets, and the effectiveness of our proposed MEDA is fully verified. Notably, the results show that MEDA can significantly outperform the conventional one-epoch training. Besides, MEDA has exhibited significant benefits in a real-world scene on Kuaishou.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 19 of its 25 references that are in the map. First posted on arXiv 31 May 2023.
Builds on
19 of 25 references.
References · 19
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2022Training language models to follow instructions with human feedbackcited by 15,971
- 2017A Closer Look at Memorization in Deep Networkscited by 942
- 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 927
- 2016Wide & Deep Learning for Recommender Systemscited by 747
- 2017DeepFM: A Factorization-Machine based Neural Network for CTR Predictioncited by 676
- 2017Deep Interest Network for Click-Through Rate Predictioncited by 544
- 2018Deep Interest Evolution Network for Click-Through Rate Predictioncited by 338
- 2016Product-based Neural Networks for User Response Predictioncited by 145
- 2019Practice on Long Sequential User Behavior Modeling for Click-Through Rate Predictioncited by 118
- 2018Learning Tree-based Deep Model for Recommender Systemscited by 99
- 2016Deep Learning over Multi-field Categorical Data: A Case Study on User Response Predictioncited by 67
7 more
- 2020Distributed Hierarchical GPU Parameter Server for Massive Scale Deep Learning Ads Systemscited by 60
- 2022Towards Understanding the Overfitting Phenomenon of Deep Click-Through Rate Prediction Modelscited by 33
- 2019Overfitting Mechanism and Avoidance in Deep Neural Networkscited by 30
- 2020DNN2LR: Interpretation-inspired Feature Crossing for Real-world Tabular Datacited by 10
- 2020An Empirical Study on Feature Discretizationcited by 6
- 2022Adversarial Filtering Modeling on Long-term User Behavior Sequences for Click-Through Rate Predictioncited by 5
- 2022LPFS: Learnable Polarizing Feature Selection for Click-Through Rate Predictioncited by 4
Built on by
Citing papers per year: 2024: 1; 2025: 2.
3 papers.