Generalize for Future: Slow and Fast Trajectory Learning for CTR Prediction
Jian Zhu, Congcong Liu, Xue Jiang, Changping Peng, Zhangang Lin, Jingping Shao
摘要
Deep neural networks (DNNs) have achieved significant advancements in click-through rate (CTR) prediction by demonstrating strong generalization on training data. However, in real-world scenarios, the assumption of independent and identically distributed (i.i.d.) conditions, which is fundamental to this problem, is often violated due to temporal distribution shifts. This violation can lead to suboptimal model performance when optimizing empirical risk without access to future data, resulting in overfitting on the training data and convergence to a single sharp minimum. To address this challenge, we propose a novel model updating framework called Slow and Fast Trajectory Learning (SFTL) network. SFTL aims to mitigate the discrepancy between past and future domains while quickly adapting to recent changes in small temporal drifts. This mechanism entails two interactions among three complementary learners: (i) the Working Learner, which updates model parameters using modern optimizers (e.g., Adam, Adagrad) and serves as the primary learner in the recommendation system, (ii) the Slow Learner, which is updated in each temporal domain by directly assigning the model weights of the working learner, and (iii) the Fast Learner, which is updated in each iteration by assigning exponentially moving average weights of the working learner. Additionally, we propose a novel rank-based trajectory loss to facilitate interaction between the working learner and trajectory learner, aiming to adapt to temporal drift and enhance performance in the current domain compared to the past. We provide theoretical understanding and conduct extensive experiments on real-world CTR prediction datasets to validate the effectiveness and efficiency of SFTL in terms of both convergence speed and model performance. The results demonstrate the superiority of SFTL over existing approaches.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper1
问问它们各自怎么用它它引用的顶会 Paper7
- Sharpness-aware Minimization for Efficiently Improving GeneralizationPierre Foret, Ariel Kleiner, Hossein Mobahi, Behnam NeyshaburICLR 2021 · 被引用 1,861 次
- Dark Experience for General Continual Learning: a Strong, Simple BaselinePietro Buzzega, Matteo Boschini, Angelo Porrello, Davide Abati 等NeurIPS 2020 · 被引用 1,494 次
- DCN V2: Improved Deep & Cross Network and Practical Lessons for Web-scale Learning to Rank SystemsRuoxi Wang, Rakesh Shivanna, Derek Zhiyuan Cheng, Sagar Jain 等WWW 2021 · 被引用 793 次
- Continuously Indexed Domain AdaptationHao Wang, Hao He, Dina KatabiICML 2020 · 被引用 129 次
- How to Retrain Recommender System?: A Sequential Meta-Learning MethodYang Zhang, Fuli Feng, Chenxu Wang, Xiangnan He 等SIGIR 2020 · 被引用 70 次
相关 Paper
- Deep Time-Stream Framework for Click-through Rate Prediction by Tracking Interest EvolutionShu-Ting Shi, Wenhao Zheng, Jun Tang, Qing-Guo Chen 等AAAI 2020 · 被引用 10 次
- Reformulating CTR Prediction: Learning Invariant Feature Interactions for RecommendationYang Zhang, Tianhao Shi, Fuli Feng, Wenjie Wang 等SIGIR 2023 · 被引用 20 次
- Looking at CTR Prediction Again: Is Attention All You Need?Yuan Cheng, Yanbo XueSIGIR 2021 · 被引用 18 次
- Improving Long-tail User CTR Prediction via Hierarchical Distribution AlignmentYifan Wang, Weizhi Ma, Min Zhang, Xiaoxiao Xu 等KDD 2025
- Learning Fast and Slow for Online Time Series ForecastingQuang Pham, Chenghao Liu, Doyen Sahoo, Steven C. H. HoiICLR 2023 · 被引用 15 次
