Efficient Transfer Learning Framework for Cross-Domain Click-Through Rate Prediction
Qi Liu, Xingyuan Tang, Jianqiang Huang, Xiangqian Yu, Haoran Jin, Jin, Chen, Yuanhao Pu, Defu Lian, Tan Qu, Zhe Wang, Jia Cheng, Jun Lei

TL;DR
This paper introduces a tri-level asynchronous transfer learning framework, E-CDCTR, that effectively transfers knowledge from natural content to advertising CTR models, addressing data sparsity and catastrophic forgetting in recommendation systems.
Contribution
The paper presents a novel tri-level transfer learning framework with tiny and complete pre-training models to improve cross-domain CTR prediction.
Findings
Significant improvement in CTR prediction accuracy.
Effective alleviation of data sparsity in advertising domain.
Reduction of catastrophic forgetting during model updates.
Abstract
Natural content and advertisement coexist in industrial recommendation systems but differ in data distribution. Concretely, traffic related to the advertisement is considerably sparser compared to that of natural content, which motivates the development of transferring knowledge from the richer source natural content domain to the sparser advertising domain. The challenges include the inefficiencies arising from the management of extensive source data and the problem of 'catastrophic forgetting' that results from the CTR model's daily updating. To this end, we propose a novel tri-level asynchronous framework, i.e., Efficient Transfer Learning Framework for Cross-Domain Click-Through Rate Prediction (E-CDCTR), to transfer comprehensive knowledge of natural content to advertisement CTR models. This framework consists of three key components: Tiny Pre-training Model ((TPM), which trains a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Computing and Algorithms
