mlsanityData to 14 Oct 2026

Continual Learning for CTR Prediction: A Hybrid Approach

arXiv 2201.06886 ↗First posted 18 Jan 2022cs.IR cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

Click-through rate(CTR) prediction is a core task in cost-per-click(CPC) advertising systems and has been studied extensively by machine learning practitioners. While many existing methods have been successfully deployed in practice, most of them are built upon i.i.d.(independent and identically distributed) assumption, ignoring that the click data used for training and inference is collected through time and is intrinsically non-stationary and drifting. This mismatch will inevitably lead to sub-optimal performance. To address this problem, we formulate CTR prediction as a continual learning task and propose COLF, a hybrid COntinual Learning Framework for CTR prediction, which has a memory-based modular architecture that is designed to adapt, learn and give predictions continuously when faced with non-stationary drifting click data streams. Married with a memory population method that explicitly controls the discrepancy between memory and target data, COLF is able to gain positive knowledge from its historical experience and makes improved CTR predictions. Empirical evaluations on click log collected from a major shopping app in China demonstrate our method's superiority over existing methods. Additionally, we have deployed our method online and observed significant CTR and revenue improvement, which further demonstrates our method's efficacy.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 18 of its 27 references that are in the map. First posted on arXiv 18 Jan 2022.

Builds on

18 of 27 references.

References · 18

  1. 2016Overcoming catastrophic forgetting in neural networkscited by 4,787
  2. 2016Learning without Forgettingcited by 2,496
  3. 2017Gradient Episodic Memory for Continual Learningcited by 1,898
  4. 2018Experience Replay for Continual Learningcited by 1,095
  5. 2018Efficient Lifelong Learning with A-GEMcited by 1,058
  6. 2017PackNet: Adding Multiple Tasks to a Single Network by Iterative Pruningcited by 898
  7. 2016Wide & Deep Learning for Recommender Systemscited by 747
  8. 2018Overcoming catastrophic forgetting with hard attention to the taskcited by 681
  9. 2017DeepFM: A Factorization-Machine based Neural Network for CTR Predictioncited by 676
  10. 2017Deep Interest Network for Click-Through Rate Predictioncited by 544
  11. 2018Learning to Learn without Forgetting by Maximizing Transfer and Minimizing Interferencecited by 521
  12. 2019Online Continual Learning with Maximally Interfered Retrievalcited by 379
6 more
  1. 2019Learn to Grow: A Continual Structure Learning Framework for Overcoming Catastrophic Forgettingcited by 302
  2. 2018Selective Experience Replay for Lifelong Learningcited by 241
  3. 2020Optimal Continual Learning has Perfect Memory and is NP-hardcited by 87
  4. 2019Deep Session Interest Network for Click-Through Rate Predictioncited by 64
  5. 2018Memory-based Parameter Adaptationcited by 35
  6. 2020ADER: Adaptively Distilled Exemplar Replay Towards Continual Learning for Session-based Recommendationcited by 22

Built on by

Cited by year

Citing papers per year: 2024: 1.

1 paper.