Kalman Filtering Attention for User Behavior Modeling in CTR Prediction
Hu Liu, Jing Lu, Xiwei Zhao, Sulong Xu, Hao Peng, Yutong Liu, Zehua Zhang, Jian Li, Junsheng Jin, Yongjun Bao, Weipeng Yan
Abstract
Click-through rate (CTR) prediction is one of the fundamental tasks for e-commerce search engines. As search becomes more personalized, it is necessary to capture the user interest from rich behavior data. Existing user behavior modeling algorithms develop different attention mechanisms to emphasize query-relevant behaviors and suppress irrelevant ones. Despite being extensively studied, these attentions still suffer from two limitations. First, conventional attentions mostly limit the attention field only to a single user's behaviors, which is not suitable in e-commerce where users often hunt for new demands that are irrelevant to any historical behaviors. Second, these attentions are usually biased towards frequent behaviors, which is unreasonable since high frequency does not necessarily indicate great importance. To tackle the two limitations, we propose a novel attention mechanism, termed Kalman Filtering Attention (KFAtt), that considers the weighted pooling in attention as a maximum a posteriori (MAP) estimation. By incorporating a priori, KFAtt resorts to global statistics when few user behaviors are relevant. Moreover, a frequency capping mechanism is incorporated to correct the bias towards frequent behaviors. Offline experiments on both benchmark and a 10 billion scale real production dataset, together with an Online A/B test, show that KFAtt outperforms all compared state-of-the-arts. KFAtt has been deployed in the ranking system of JD.com, one of the largest B2C e-commerce websites in China, serving the main traffic of hundreds of millions of active users.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext afb2f052-5cb8-45ba-9a34-c2ab22cabd9aCited by top-tier papers6
- Multi-Task Recommendations with Reinforcement LearningZiru Liu, Jiejie Tian, Qingpeng Cai, Xiangyu Zhao et al.WWW 2023 · 57 citations
- Towards Open-World Recommendation: An Inductive Model-based Collaborative Filtering ApproachQitian Wu, Hengrui Zhang, Xiaofeng Gao, Junchi Yan et al.ICML 2021 · 48 citations
- Learning Self-Modulating Attention in Continuous Time Space with Applications to Sequential RecommendationChao Chen, Haoyu Geng, Nianzu Yang, Junchi Yan et al.ICML 2021 · 12 citations
- Decision-Making Context Interaction Network for Click-Through Rate PredictionXiang Li, Shuwei Chen, Jian Dong, Jin Zhang et al.AAAI 2023 · 11 citations
- AdaptSSR: Pre-training User Model with Augmentation-Adaptive Self-Supervised RankingYang Yu, Qi Liu, Kai Zhang, Yuren Zhang et al.NeurIPS 2023 · 4 citations
Related papers
- Implicit User Awareness Modeling via Candidate Items for CTR Prediction in Search AdsKaifu Zheng, Lu Wang, Yu Li, Xusong Chen et al.WWW 2022 · 17 citations
- HIEN: Hierarchical Intention Embedding Network for Click-Through Rate PredictionZuowu Zheng, Changwang Zhang, Xiaofeng Gao, Guihai ChenSIGIR 2022 · 16 citations
- Deep Match to Rank Model for Personalized Click-Through Rate PredictionZequn Lyu, Yu Dong, Chengfu Huo, Weijun RenAAAI 2020 · 73 citations
- Looking at CTR Prediction Again: Is Attention All You Need?Yuan Cheng, Yanbo XueSIGIR 2021 · 18 citations
- DMBIN: A Dual Multi-behavior Interest Network for Click-Through Rate Prediction via Contrastive LearningTianqi He, Kaiyuan Li, Shan Chen, Haitao Wang et al.SIGIR 2023 · 8 citations
