mlsanityData to 14 Oct 2026

Learning Explicit User Interest Boundary for Recommendation

arXiv 2111.11026 ↗First posted 22 Nov 2021cs.IR cs.AIcited by 6

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

  1. 2019PyTorch: An Imperative Style, High-Performance Deep Learning Librarycited by 20,305
  2. 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,139
  3. 2017Neural Collaborative Filteringcited by 1,111
  4. 2016Ups and Downs: Modeling the Visual Evolution of Fashion Trends with One-Class Collaborative Filteringcited by 520
  5. 2020Circle Loss: A Unified Perspective of Pair Similarity Optimizationcited by 403
  6. 2017IRGAN: A Minimax Game for Unifying Generative and Discriminative Information Retrieval Modelscited by 75
  7. 2021SimpleX: A Simple and Strong Baseline for Collaborative Filteringcited by 65
  8. 2018Adversarial Personalized Ranking for Recommendationcited by 49
  9. 2018NSCaching: Simple and Efficient Negative Sampling for Knowledge Graph Embeddingcited by 42
  10. 2020Simplify and Robustify Negative Sampling for Implicit Collaborative Filteringcited by 34
  11. 2018Adversarial Sampling and Training for Semi-Supervised Information Retrievalcited by 23
  12. 2021Top-N Recommendation with Counterfactual User Preference Simulationcited by 21
3 more
  1. 2019Collaborative Translational Metric Learningcited by 16
  2. 2017Representation Learning and Pairwise Ranking for Implicit Feedback in Recommendation Systemscited by 11
  3. 2018DeepFM: An End-to-End Wide & Deep Learning Framework for CTR Predictioncited by 9

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 3; 2024: 1; 2025: 1.

6 papers.