Personalized Diversification for Neural Re-ranking in Recommendation
Weiwen Liu, Yunjia Xi, Jiarui Qin, Xinyi Dai, Ruiming Tang, Shuai Li, Weinan Zhang, Rui Zhang
Abstract
Re-ranking, as the final stage of the multi-stage recommender systems (MRS), aims at modeling the listwise context and the cross-item interactions between the candidate items. The objective is usually the overall utility (e.g., total clicks or revenue) of the re-ranked list, which is determined not only by the relevance, but also by the diversity of the list. However, existing methods equally promote diversity for all users and often compromise the relevance ranking. In reality, users have different diversity preferences and we should diversify the list tailored to individual users’ interests and needs. Users’ behavior history contains rich information which may be used for inferring their diversity preferences, but has rarely been explored in existing work. In this work, we propose a novel neural re-ranking with personalized diversification method (dubbed RAPID) to address the above challenge. RAPID explicitly models each user’s preference distribution over different topics by exploiting the intra- and inter-topic interactions from the user’s behavior history. The personalized diversity gain brought by each candidate item is then measured by the item’s marginal diversity and the learned personalized preference. The relevance and the personalized diversity are jointly optimized in an end-to-end manner to automatically manage the relevance-diversity tradeoff. Experimental results on two public datasets and a proprietary dataset show that RAPID outperforms the state-of-the-art with the highest utility and the best relevance-diversity tradeoff. We further prove that RAPID has a regret bound of on utility, which provides theoretical guarantee that its performance is near-optimal.
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 2fca3105-57eb-455a-a6b6-b0e075fcf249Cited by top-tier papers5
- Uncovering the Propensity Identification Problem in Debiased RecommendationsHonglei Zhang, Shuyi Wang, Haoxuan Li, Chunyuan Zheng et al.ICDE 2024 · 12 citations
- NR4DER: Neural Re-ranking for Diversified Exercise RecommendationXinghe Cheng, Xufang Zhou, Liangda Fang, Chaobo He et al.SIGIR 2025 · 5 citations
- Discovering Top-k Relevant and Diversified RulesWenfei Fan, Ziyan Han, Min Xie, Guangyi ZhangSIGMOD 2025 · 2 citations
- Quantifying the Potential to Escape Filter Bubbles: A Behavior-Aware Measure via Contrastive SimulationDifu Feng, Qianqian Xu, Zitai Wang, Cong Hua et al.AAAI 2026 · 1 citation
- Hounding Data Diversity: Towards Participant Selection in Vertical Federated LearningXiaokai Zhou, Xiao Yan, Fangcheng Fu, Xinyan Li et al.ICDE 2025 · 1 citation
Related papers
- Multi-Level Interaction Reranking with User Behavior HistoryYunjia Xi, Weiwen Liu, Jieming Zhu, Xilong Zhao et al.SIGIR 2022 · 21 citations
- Relevance Meets Diversity: A User-Centric Framework for Knowledge Exploration Through RecommendationsErica Coppolillo, Giuseppe Manco, Aristides GionisKDD 2024 · 9 citations
- Gradient-Based Diversity Optimization with Differentiable Top- ObjectiveTianyi Zhou, Sebastian Dalleiger, Ece Calikus, Aristides GionisICLR 2026
- A Hybrid Bandit Framework for Diversified RecommendationQinxu Ding, Yong Liu, Chunyan Miao, Fei Cheng et al.AAAI 2021 · 26 citations
- Controlling Diversity at Inference: Guiding Diffusion Recommender Models with Targeted Category PreferencesGwangseok Han, Wonbin Kweon, Minsoo Kim, Hwanjo YuKDD 2025
