Learning Explicit User Interest Boundary for Recommendation
Jianhuan Zhuo, Qiannan Zhu, Yinliang Yue, Yuhong Zhao
Abstract
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.
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 7c09030e-a447-46bd-a891-af3cd94072d0Cited by top-tier papers2
- From Pairwise to Ranking: Climbing the Ladder to Ideal Collaborative Filtering with Pseudo-RankingYuhan Zhao, Rui Chen, Li Chen, Shuang Zhang et al.AAAI 2025 ยท 4 citations
- Stability-Based Generalization Analysis for Mixtures of Pointwise and Pairwise LearningJiahuan Wang, Jun Chen, Hong Chen, Bin Gu et al.AAAI 2023 ยท 2 citations
Builds on4
- LightGCN: Simplifying and Powering Graph Convolution Network for RecommendationXiangnan He, Kuan Deng, Xiang Wang, Yan Li et al.SIGIR 2020 ยท 4,448 citations
- Simplify and Robustify Negative Sampling for Implicit Collaborative FilteringJingtao Ding, Yuhan Quan, Quanming Yao, Yong Li et al.NeurIPS 2020 ยท 131 citations
- Symmetric Metric Learning with Adaptive Margin for RecommendationMingming Li, Shuai Zhang, Fuqing Zhu, Wanhui Qian et al.AAAI 2020 ยท 67 citations
- Circle Loss: A Unified Perspective of Pair Similarity OptimizationYifan Sun, Changmao Cheng, Yuhan Zhang, Chi Zhang et al.CVPR 2020
Related papers
- Density-Ratio Based Personalised Ranking from Implicit FeedbackRiku Togashi, Masahiro Kato, Mayu Otani, Shin'ichi SatohWWW 2021 ยท 8 citations
- Personalized Denoising Implicit Feedback for Robust Recommender SystemKaike Zhang, Qi Cao, Yunfan Wu, Fei Sun et al.WWW 2025 ยท 12 citations
- StabCF: A Stabilized Training Method for Collaborative FilteringXi Wu, Wenzhe Zhang, Liangwei Yang, Yi Zhao et al.KDD 2026
- SetRank: A Setwise Bayesian Approach for Collaborative Ranking from Implicit FeedbackChao Wang, Hengshu Zhu, Chen Zhu, Chuan Qin et al.AAAI 2020 ยท 53 citations
- Sampler Design for Implicit Feedback Data by Noisy-label Robust LearningWenhui Yu, Zheng QinSIGIR 2020 ยท 54 citations
