Dimension Independent Mixup for Hard Negative Sample in Collaborative Filtering
Not on the map. Why?
Abstract (arXiv)
Collaborative filtering (CF) is a widely employed technique that predicts user preferences based on past interactions. Negative sampling plays a vital role in training CF-based models with implicit feedback. In this paper, we propose a novel perspective based on the sampling area to revisit existing sampling methods. We point out that current sampling methods mainly focus on Point-wise or Line-wise sampling, lacking flexibility and leaving a significant portion of the hard sampling area un-explored. To address this limitation, we propose Dimension Independent Mixup for Hard Negative Sampling (DINS), which is the first Area-wise sampling method for training CF-based models. DINS comprises three modules: Hard Boundary Definition, Dimension Independent Mixup, and Multi-hop Pooling. Experiments with real-world datasets on both matrix factorization and graph-based models demonstrate that DINS outperforms other negative sampling methods, establishing its effectiveness and superiority. Our work contributes a new perspective, introduces Area-wise sampling, and presents DINS as a novel approach that achieves state-of-the-art performance for negative sampling. Our implementations are available in PyTorch.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 22 of its 41 references that are in the map. First posted on arXiv 28 Jun 2023.
Builds on
22 of 41 references.
References · 22
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2017mixup: Beyond Empirical Risk Minimizationcited by 5,155
- 2013Distributed Representations of Words and Phrases and their Compositionalitycited by 3,462
- 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
- 2020Self-supervised Graph Learning for Recommendationcited by 305
- 2017IRGAN: A Minimax Game for Unifying Generative and Discriminative Information Retrieval Modelscited by 75
- 2019NPA: Neural News Recommendation with Personalized Attentioncited by 73
- 2017On Sampling Strategies for Neural Network-based Collaborative Filteringcited by 71
- 2020Understanding Negative Sampling in Graph Representation Learningcited by 66
- 2021SimpleX: A Simple and Strong Baseline for Collaborative Filteringcited by 65
10 more
- 2020Reinforced Negative Sampling over Knowledge Graph for Recommendationcited by 40
- 2021ConsisRec: Enhancing GNN for Social Recommendation via Consistent Neighbor Aggregationcited by 39
- 2020Simplify and Robustify Negative Sampling for Implicit Collaborative Filteringcited by 34
- 2021Dense Hierarchical Retrieval for Open-Domain Question Answeringcited by 33
- 2022DGRec: Graph Neural Network for Recommendation with Diversified Embedding Generationcited by 33
- 2018Adversarial Sampling and Training for Semi-Supervised Information Retrievalcited by 23
- 2022SVD-GCN: A Simplified Graph Convolution Paradigm for Recommendationcited by 16
- 2022Large-scale Personalized Video Game Recommendation via Social-aware Contextualized Graph Neural Networkcited by 14
- 2022MetaKRec: Collaborative Meta-Knowledge Enhanced Recommender Systemcited by 4
- 2022Enhancing Recommender Systems: A Strategy to Mitigate False Negative Impactcited by 2
Built on by
Citing papers per year: 2024: 2.
2 papers.