Towards Reliable Negative Sampling for Recommendation with Implicit Feedback via In-Community Popularity
On the map: LLM alignment / RLHF / preference optimisation → Preference alignment for recommenders and RAG
Abstract (arXiv)
Learning from implicit feedback is a fundamental problem in modern recommender systems, where only positive interactions are observed and explicit negative signals are unavailable. In such settings, negative sampling plays a critical role in model training by constructing negative items that enable effective preference learning and ranking optimization. However, designing reliable negative sampling strategies remains challenging, as they must simultaneously ensure realness, hardness, and interpretability. To this end, we propose ICPNS (In-Community Popularity Negative Sampling), a novel framework that leverages user community structure to identify reliable and informative negative samples. Our approach is grounded in the insight that item exposure is driven by latent user communities. By identifying these communities and utilizing in-community popularity, ICPNS effectively approximates the probability of item exposure. Consequently, items that are popular within a user's community but remain unclicked are identified as more reliable true negatives. Extensive experiments on four benchmark datasets demonstrate that ICPNS yields consistent improvements on graph-based recommenders and competitive performance on MF-based models, outperforming representative negative sampling strategies under a unified evaluation protocol.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in Preference alignment for recommenders and RAG, one of 10 directions in LLM alignment / RLHF / preference optimisation. Builds on 13 of its 28 references that are in the map. First posted on arXiv 21 Feb 2026.
Builds on
13 of 28 references.
References · 13
- 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,134
- 2018Graph Convolutional Neural Networks for Web-Scale Recommender Systemscited by 1,133
- 2019Neural Graph Collaborative Filteringcited by 660
- 2020RecBole: Towards a Unified, Comprehensive and Efficient Framework for Recommendation Algorithmscited by 137
- 2017Fast Matrix Factorization for Online Recommendation with Implicit Feedbackcited by 100
- 2015Modeling User Exposure in Recommendationcited by 69
- 2020Understanding Negative Sampling in Graph Representation Learningcited by 66
- 2022Multi-Behavior Hypergraph-Enhanced Transformer for Sequential Recommendationcited by 42
- 2018Learning from History and Present: Next-item Recommendation via Discriminatively Exploiting User Behaviorscited by 27
- 2023On the Theories Behind Hard Negative Sampling for Recommendationcited by 18
- 2020Fast Adaptively Weighted Matrix Factorization for Recommendation with Implicit Feedbackcited by 17
- 2024Adaptive Hardness Negative Sampling for Collaborative Filteringcited by 8
1 more
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2025Hard Negative Sampling via Large Language Models for Recommendation
- 2024SCONE: A Novel Stochastic Sampling to Generate Contrastive Views and Hard Negative Samples for Recommendation
- 2025On Negative-aware Preference Optimization for Recommendation
- 2026CoNRec: Context-Discerning Negative Recommendation with LLMs
- 2025Causal Negative Sampling via Diffusion Model for Out-of-Distribution Recommendation
- 2025Generating Negative Samples for Multi-Modal Recommendation
- 2024Balancing User Preferences by Social Networks: A Condition-Guided Social Recommendation Model for Mitigating Popularity Bias
- 2025Towards A Tri-View Diffusion Framework for Recommendation