Learning Explicit User Interest Boundary for Recommendation
Not on the map. Why?
Abstract (arXiv)
The core objective of modelling recommender systems from implicit feedback is to maximize the positive sample score sp and minimize the negative sample score sn, 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 sn - sp, 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 bu 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 bu and the negative samples whose score is higher than bu. 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.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 15 of its 37 references that are in the map. First posted on arXiv 22 Nov 2021.
Builds on
15 of 37 references.
References · 15
- 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
- 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,139
- 2017Neural Collaborative Filteringcited by 1,111
- 2016Ups and Downs: Modeling the Visual Evolution of Fashion Trends with One-Class Collaborative Filteringcited by 520
- 2020Circle Loss: A Unified Perspective of Pair Similarity Optimizationcited by 403
- 2017IRGAN: A Minimax Game for Unifying Generative and Discriminative Information Retrieval Modelscited by 75
- 2021SimpleX: A Simple and Strong Baseline for Collaborative Filteringcited by 65
- 2018Adversarial Personalized Ranking for Recommendationcited by 49
- 2018NSCaching: Simple and Efficient Negative Sampling for Knowledge Graph Embeddingcited by 42
- 2020Simplify and Robustify Negative Sampling for Implicit Collaborative Filteringcited by 34
- 2018Adversarial Sampling and Training for Semi-Supervised Information Retrievalcited by 23
- 2021Top-N Recommendation with Counterfactual User Preference Simulationcited by 21
Built on by
Citing papers per year: 2022: 1; 2023: 3; 2024: 1; 2025: 1.
6 papers.
- 2023Toward a Better Understanding of Loss Functions for Collaborative Filteringcited by 8
- 2023Stability-based Generalization Analysis for Mixtures of Pointwise and Pairwise Learningcited by 1
- 2022SPR:Supervised Personalized Ranking Based on Prior Knowledge for Recommendationcited by 0
- 2023Hypergraph-Enhanced Dual Convolutional Network for Bundle Recommendationcited by 0
- 2024Multi-Margin Cosine Loss: Proposal and Application in Recommender Systemscited by 0
- 2025NDCG-Consistent Softmax Approximation with Accelerated Convergencecited by 0
- 2025NDCG-Consistent Softmax Approximation with Accelerated Convergence11 Jun 2025
- 2024Multi-Margin Cosine Loss: Proposal and Application in Recommender Systems7 May 2024
- 2023Hypergraph-Enhanced Dual Convolutional Network for Bundle Recommendation18 Dec 2023
- 2023Toward a Better Understanding of Loss Functions for Collaborative Filtering11 Aug 2023
- 2023Stability-based Generalization Analysis for Mixtures of Pointwise and Pairwise Learning20 Feb 2023
- 2022SPR:Supervised Personalized Ranking Based on Prior Knowledge for Recommendation7 Jul 2022