Multi-Margin Cosine Loss: Proposal and Application in Recommender Systems
Not on the map. Why?
Abstract (arXiv)
Recommender systems guide users through vast amounts of information by suggesting items based on their predicted preferences. Collaborative filtering-based deep learning techniques have regained popularity due to their straightforward nature, relying only on user-item interactions. Typically, these systems consist of three main components: an interaction module, a loss function, and a negative sampling strategy. Initially, researchers focused on enhancing performance by developing complex interaction modules. However, there has been a recent shift toward refining loss functions and negative sampling strategies. This shift has led to an increased interest in contrastive learning, which pulls similar pairs closer while pushing dissimilar ones apart. Contrastive learning may bring challenges like high memory demands and under-utilization of some negative samples. The proposed Multi-Margin Cosine Loss (MMCL) addresses these challenges by introducing multiple margins and varying weights for negative samples. It efficiently utilizes not only the hardest negatives but also other non-trivial negatives, offers a simpler yet effective loss function that outperforms more complex methods, especially when resources are limited. Experiments on two well-known datasets demonstrated that MMCL achieved up to a 20% performance improvement compared to a baseline loss function when fewer number of negative samples are used.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 21 of its 40 references that are in the map. First posted on arXiv 7 May 2024.
Builds on
21 of 40 references.
References · 21
- 2018Representation Learning with Contrastive Predictive Codingcited by 7,777
- 2015FaceNet: A Unified Embedding for Face Recognition and Clusteringcited by 2,849
- 2017Neural Collaborative Filteringcited by 1,111
- 2019BERT4Rec: Sequential Recommendation with Bidirectional Encoder Representations from Transformercited by 964
- 2023Recommender Systems in the Era of Large Language Models (LLMs)cited by 189
- 2020Revisiting Graph based Collaborative Filtering: A Linear Residual Graph Convolutional Network Approachcited by 120
- 2016Item2Vec: Neural Item Embedding for Collaborative Filteringcited by 72
- 2021SimpleX: A Simple and Strong Baseline for Collaborative Filteringcited by 65
- 2022On the Effectiveness of Sampled Softmax Loss for Item Recommendationcited by 39
- 2021AutoLoss: Automated Loss Function Search in Recommendationscited by 31
- 2022Incorporating Bias-aware Margins into Contrastive Loss for Collaborative Filteringcited by 29
- 2023Empowering Collaborative Filtering with Principled Adversarial Contrastive Losscited by 24
9 more
- 2020Sampling-Decomposable Generative Adversarial Recommendercited by 16
- 2024Does Negative Sampling Matter? A Review with Insights into its Theory and Applicationscited by 15
- 2022AutoLossGen: Automatic Loss Function Generation for Recommender Systemscited by 10
- 2024Neighborhood-Enhanced Supervised Contrastive Learning for Collaborative Filteringcited by 10
- 2023Toward a Better Understanding of Loss Functions for Collaborative Filteringcited by 8
- 2021Learning Explicit User Interest Boundary for Recommendationcited by 6
- 2023Revisiting Recommendation Loss Functions through Contrastive Learning (Technical Report)cited by 5
- 2023BSL: Understanding and Improving Softmax Loss for Recommendationcited by 5
- 2016From Word Embeddings to Item Recommendationcited by 4
Built on by
Not cited yet.