Dimension Independent Mixup for Hard Negative Sample in Collaborative Filtering
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.
Code (1)
Tasks
Collaborative FilteringMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
DropMix: Better Graph Contrastive Learning with Harder Negative Samples
While generating better negative samples for contrastive learning has been widely studied in the areas of CV and NLP, very few work has focused on graph-structured data. Recently, Mixup has been introduced to synthesize …
Contrastive LearningNegative Sampling with Adaptive Denoising Mixup for Knowledge Graph Embedding
Knowledge graph embedding (KGE) aims to map entities and relations of a knowledge graph (KG) into a low-dimensional and dense vector space via contrasting the positive and negative triples. In the training process of KGE…
DenoisingGraph EmbeddingKnowledge Graph CompletionKnowledge Graph Embedding+1Mixup Your Own Pairs
In representation learning, regression has traditionally received less attention than classification. Directly applying representation learning techniques designed for classification to regression often results in fragme…
Contrastive LearningregressionRepresentation LearningTime Series+1Universum-inspired Supervised Contrastive Learning
As an effective data augmentation method, Mixup synthesizes an extra amount of samples through linear interpolations. Despite its theoretical dependency on data properties, Mixup reportedly performs well as a regularizer…
Contrastive LearningData Augmentation$m$-mix: Generating hard negatives via multiple samples mixing for contrastive learning
Negative pairs are essential in contrastive learning, which plays the role of avoiding degenerate solutions. Hard negatives can improve the representation ability on the basis of common negatives. Inspired by recent hard…
ClassificationContrastive LearningGraph Classificationimage-classification+2