User-Aware Multi-Interest Learning for Candidate Matching in Recommenders
Zheng Chai, Zhihong Chen, Chenliang Li, Rong Xiao, Houyi Li, Jiawei Wu, Jingxu Chen, Haihong Tang
Abstract
Recommender systems have become a fundamental service in most E-Commerce platforms, in which the matching stage aims to retrieve potentially relevant candidate items to users for further ranking. Recently, some efforts on extracting multi-interests from user's historical behaviors have demonstrated superior performance. However, the historical behaviors are not noise-free due to the possible misclicks or disturbances. Existing works mainly overlook the fact that the interests of a user are not only reflected by the historical behaviors, but also inherently regulated by the profile information. Hence, we are interested in exploiting the benefit of user profile in multi-interest learning to enhance candidate matching performance. To this end, a user-aware multi-interest learning framework (named UMI) is proposed in this paper to exploit both user profile and behavior information for candidate matching. Specifically, UMI consists of two main components: dual-attention routing and interest refinement. In the dual-attention routing, we firstly introduce a user-guided attention network to identify the important historical items with respect to the user profile. Then, the resultant importance weights are leveraged via the dual-attentive capsule network to extract the user's multi-interests. Afterwards, the extracted interests are utilized to highlight the corresponding user profile features for interest refinement, such that different user profiles can be incorporated into interest learning for diverse user preference understanding. Besides, to improve the model's discriminative capacity, we further devise a harder-negatives strategy to support model optimization. Extensive experiments show that UMI significantly outperforms state-of-the-art multi-interest modeling alternatives. Currently, UMI has been successfully deployed at Taobao App in Alibaba, serving hundreds of millions of users.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 0146f804-2e06-4366-8a1e-14c1c7ec26e9Cited by top-tier papers1
Ask how each one uses itRelated papers
- FINN: Feedback Interactive Neural Network for Intent RecommendationYatao Yang, Biyu Ma, Jun Tan, Hongbo Deng et al.WWW 2021 · 9 citations
- Countering Interest Over-Smoothing: Distilling Latent Factors via Diffusion for Multi-Interest RetrievalYankun Le, Fu Zhang, Haoran Li, Baoyuan Ou et al.SIGIR 2026
- Incremental Learning for Multi-Interest Sequential RecommendationZhikai Wang, Yanyan ShenICDE 2023 · 16 citations
- Graph Meta Network for Multi-Behavior RecommendationLianghao Xia, Yong Xu, Chao Huang, Peng Dai et al.SIGIR 2021 · 219 citations
- When Multi-Behavior Meets Multi-Interest: Multi-Behavior Sequential Recommendation with Multi-Interest Self-Supervised LearningBinquan Wu, Yu Cheng, Haitao Yuan, Qianli MaICDE 2024 · 10 citations
