REVIEW 3 cited by
Multi-Epoch learning with Data Augmentation for Deep Click-Through Rate Prediction
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
This paper investigates the one-epoch overfitting phenomenon in Click-Through Rate (CTR) models, where performance notably declines at the start of the second epoch. Despite extensive research, the efficacy of multi-epoch training over the conventional one-epoch approach remains unclear. We identify the overfitting of the embedding layer, caused by high-dimensional data sparsity, as the primary issue. To address this, we introduce a novel and simple Multi-Epoch learning with Data Augmentation (MEDA) framework, suitable for both non-continual and continual learning scenarios, which can be seamlessly integrated into existing deep CTR models and may have potential applications to handle the "forgetting or overfitting" dilemma in the retraining and the well-known catastrophic forgetting problems. MEDA minimizes overfitting by reducing the dependency of the embedding layer on subsequent training data or the Multi-Layer Perceptron (MLP) layers, and achieves data augmentation through training the MLP with varied embedding spaces. Our findings confirm that pre-trained MLP layers can adapt to new embedding spaces, enhancing performance without overfitting. This adaptability underscores the MLP layers' role in learning a matching function focused on the relative relationships among embeddings rather than their absolute positions. To our knowledge, MEDA represents the first multi-epoch training strategy tailored for deep CTR prediction models. We conduct extensive experiments on several public and business datasets, and the effectiveness of data augmentation and superiority over conventional single-epoch training are fully demonstrated. Besides, MEDA has exhibited significant benefits in a real-world online advertising system.
Forward citations
Cited by 3 Pith papers
-
Scaling Transformers for Discriminative Recommendation via Generative Pretraining
Generative pretraining plus sparse-embedding freezing makes large Transformer ranking models scale consistently, following a power law from 13K to 0.3B dense parameters.
-
The Evolution of Embedding Table Optimization and Multi-Epoch Training in Pinterest Ads Conversion
A frequency-adaptive learning rate that slows updates to rare embedding IDs reduces multi-epoch overfitting for some sparse ad-conversion objectives, but not the sparsest, and its advantage disappears after days of co...
-
Adaptive$^2$: Adaptive Domain Mining for Fine-grained Domain Adaptation Modeling
Adaptive^2 learns latent domain assignments with VQ-VAE and uses them to route inputs through shared and domain-specific networks, outperforming hand-crafted domain baselines in ad CTR prediction.
Discussion (0). Continue with ORCID to comment.