Learning Explicit User Interest Boundary for Recommendation
Jianhuan Zhuo, Qiannan Zhu, Yinliang Yue, Yuhong Zhao
摘要
The core objective of modelling recommender systems from implicit feedback is to maximize the positive sample score 𝑠 𝑝 and minimize the negative sample score 𝑠 𝑛 , which can usually be summarized into two paradigms: the pointwise and the pairwise. The pointwise approaches fit each sample with its label individually, which is flexible in weighting and sampling on instance-level but ignores the inherent ranking property. By qualitatively minimizing the relative score 𝑠 𝑛 -𝑠 𝑝 , the pairwise approaches capture the ranking of samples naturally but suffer from training efficiency. Additionally, both approaches are hard to explicitly provide a personalized decision boundary to determine if users are interested in items unseen. To address those issues, we innovatively introduce an auxiliary score 𝑏 𝑢 for each user to represent the User Interest Boundary(UIB) and individually penalize samples that cross the boundary with pairwise paradigms, i.e., the positive samples whose score is lower than 𝑏 𝑢 and the negative samples whose score is higher than 𝑏 𝑢 . In this way, our approach successfully achieves a hybrid loss of the pointwise and the pairwise to combine the advantages of both. Analytically, we show that our approach can provide a personalized decision boundary and significantly improve the training efficiency without any special sampling strategy. Extensive results show that our approach achieves significant improvements on not only the classical pointwise or pairwise models but also state-of-the-art models with complex loss function and complicated feature encoding. CCS CONCEPTS • Computing methodologies → Ranking; • Information systems → Learning to rank.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
引用它的顶会 Paper2
- From Pairwise to Ranking: Climbing the Ladder to Ideal Collaborative Filtering with Pseudo-RankingYuhan Zhao, Rui Chen, Li Chen, Shuang Zhang 等AAAI 2025 · 被引用 4 次
- Stability-Based Generalization Analysis for Mixtures of Pointwise and Pairwise LearningJiahuan Wang, Jun Chen, Hong Chen, Bin Gu 等AAAI 2023 · 被引用 2 次
它引用的顶会 Paper4
- LightGCN: Simplifying and Powering Graph Convolution Network for RecommendationXiangnan He, Kuan Deng, Xiang Wang, Yan Li 等SIGIR 2020 · 被引用 4,448 次
- Simplify and Robustify Negative Sampling for Implicit Collaborative FilteringJingtao Ding, Yuhan Quan, Quanming Yao, Yong Li 等NeurIPS 2020 · 被引用 131 次
- Symmetric Metric Learning with Adaptive Margin for RecommendationMingming Li, Shuai Zhang, Fuqing Zhu, Wanhui Qian 等AAAI 2020 · 被引用 67 次
- Circle Loss: A Unified Perspective of Pair Similarity OptimizationYifan Sun, Changmao Cheng, Yuhan Zhang, Chi Zhang 等CVPR 2020
相关 Paper
- Density-Ratio Based Personalised Ranking from Implicit FeedbackRiku Togashi, Masahiro Kato, Mayu Otani, Shin'ichi SatohWWW 2021 · 被引用 8 次
- Personalized Denoising Implicit Feedback for Robust Recommender SystemKaike Zhang, Qi Cao, Yunfan Wu, Fei Sun 等WWW 2025 · 被引用 12 次
- StabCF: A Stabilized Training Method for Collaborative FilteringXi Wu, Wenzhe Zhang, Liangwei Yang, Yi Zhao 等KDD 2026
- SetRank: A Setwise Bayesian Approach for Collaborative Ranking from Implicit FeedbackChao Wang, Hengshu Zhu, Chen Zhu, Chuan Qin 等AAAI 2020 · 被引用 53 次
- Sampler Design for Implicit Feedback Data by Noisy-label Robust LearningWenhui Yu, Zheng QinSIGIR 2020 · 被引用 54 次
