Augmented Negative Sampling for Collaborative Filtering
Not on the map. Why?
Abstract (arXiv)
Negative sampling is essential for implicit-feedback-based collaborative filtering, which is used to constitute negative signals from massive unlabeled data to guide supervised learning. The state-of-the-art idea is to utilize hard negative samples that carry more useful information to form a better decision boundary. To balance efficiency and effectiveness, the vast majority of existing methods follow the two-pass approach, in which the first pass samples a fixed number of unobserved items by a simple static distribution and then the second pass selects the final negative items using a more sophisticated negative sampling strategy. However, selecting negative samples from the original items is inherently restricted, and thus may not be able to contrast positive samples well. In this paper, we confirm this observation via experiments and introduce two limitations of existing solutions: ambiguous trap and information discrimination. Our response to such limitations is to introduce augmented negative samples. This direction renders a substantial technical challenge because constructing unconstrained negative samples may introduce excessive noise that distorts the decision boundary. To this end, we introduce a novel generic augmented negative sampling paradigm and provide a concrete instantiation. First, we disentangle hard and easy factors of negative items. Next, we generate new candidate negative samples by augmenting only the easy factors in a regulated manner: the direction and magnitude of the augmentation are carefully calibrated. Finally, we design an advanced negative sampling strategy to identify the final augmented negative samples, which considers not only the score function used in existing methods but also a new metric called augmentation gain. Extensive experiments on real-world datasets demonstrate that our method significantly outperforms state-of-the-art baselines.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). First posted on arXiv 11 Aug 2023.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 4; 2025: 0; 2026: 3.
7 papers.
- 2024AlignRec: Aligning and Training in Multimodal Recommendationscited by 20
- 2024Curriculum Negative Mining For Temporal Networkscited by 1
- 2024Negative Feedback for Music Personalizationcited by 0
- 2024HACD: Harnessing Attribute Semantics and Mesoscopic Structure for Community Detectioncited by 0
- 2026Post-Training Fairness Control: A Single-Train Framework for Dynamic Fairness in Recommendationcited by 0
- 2026TFPS: A Temporal Filtration-enhanced Positive Sample Set Construction Method for Implicit Collaborative Filteringcited by 0
- 2026Anchored Alignment: Preventing Positional Collapse in Multimodal Recommender Systemscited by 0
- 2026Anchored Alignment: Preventing Positional Collapse in Multimodal Recommender Systems13 Mar 2026
- 2026TFPS: A Temporal Filtration-enhanced Positive Sample Set Construction Method for Implicit Collaborative Filtering26 Feb 2026
- 2026Post-Training Fairness Control: A Single-Train Framework for Dynamic Fairness in Recommendation28 Jan 2026
- 2024HACD: Harnessing Attribute Semantics and Mesoscopic Structure for Community Detection4 Nov 2024
- 2024Curriculum Negative Mining For Temporal Networks24 Jul 2024
- 2024Negative Feedback for Music Personalization6 Jun 2024
- 2024AlignRec: Aligning and Training in Multimodal Recommendations19 Mar 2024