Sampler Design for Bayesian Personalized Ranking by Leveraging View Data
Not on the map. Why?
Abstract (arXiv)
Bayesian Personalized Ranking (BPR) is a representative pairwise learning method for optimizing recommendation models. It is widely known that the performance of BPR depends largely on the quality of negative sampler. In this paper, we make two contributions with respect to BPR. First, we find that sampling negative items from the whole space is unnecessary and may even degrade the performance. Second, focusing on the purchase feedback of E-commerce, we propose an effective sampler for BPR by leveraging the additional view data. In our proposed sampler, users' viewed interactions are considered as an intermediate feedback between those purchased and unobserved interactions. The pairwise rankings of user preference among these three types of interactions are jointly learned, and a user-oriented weighting strategy is considered during learning process, which is more effective and flexible. Compared to the vanilla BPR that applies a uniform sampler on all candidates, our view-enhanced sampler enhances BPR with a relative improvement over 37.03% and 16.40% on two real-world datasets. Our study demonstrates the importance of considering users' additional feedback when modeling their preference on different items, which avoids sampling negative items indiscriminately and inefficiently.
Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). First posted on arXiv 21 Sep 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 1; 2023: 1; 2024: 3; 2025: 0; 2026: 3.
11 papers.
- 2024Denoising Diffusion Recommender Modelcited by 28
- 2021Bootstrapping User and Item Representations for One-Class Collaborative Filteringcited by 22
- 2022Efficient Bi-Level Optimization for Recommendation Denoisingcited by 20
- 2024Double Correction Framework for Denoising Recommendationcited by 19
- 2021Learning Robust Recommenders through Cross-Model Agreementcited by 15
- 2021Scalable Personalised Item Ranking through Parametric Density Estimationcited by 0
- 2023Label Denoising through Cross-Model Agreementcited by 0
- 2024When SparseMoE Meets Noisy Interactions: An Ensemble View on Denoising Recommendationcited by 0
- 2026Learning Robust Recommenders from Noisy Implicit Feedback via GMM-Weighted Bayesian Transition Matrixcited by 0
- 2026ANCHOR: Agentic Noise Creation Framework for Human Simulation and Denoising Recommendationcited by 0
- 2026Denoising Implicit Feedback for Cold-start Recommendationcited by 0
- 2026Denoising Implicit Feedback for Cold-start Recommendation17 Jun 2026
- 2026ANCHOR: Agentic Noise Creation Framework for Human Simulation and Denoising Recommendation4 Jun 2026
- 2026Learning Robust Recommenders from Noisy Implicit Feedback via GMM-Weighted Bayesian Transition Matrix20 May 2026
- 2024When SparseMoE Meets Noisy Interactions: An Ensemble View on Denoising Recommendation19 Sep 2024
- 2024Double Correction Framework for Denoising Recommendation18 May 2024
- 2024Denoising Diffusion Recommender Model13 Jan 2024
- 2023Label Denoising through Cross-Model Agreement27 Aug 2023
- 2022Efficient Bi-Level Optimization for Recommendation Denoising19 Oct 2022
- 2021Learning Robust Recommenders through Cross-Model Agreement20 May 2021
- 2021Bootstrapping User and Item Representations for One-Class Collaborative Filtering13 May 2021
- 2021Scalable Personalised Item Ranking through Parametric Density Estimation11 May 2021