mlsanityData to 7 Oct 2026

SimCE: Simplifying Cross-Entropy Loss for Collaborative Filtering

arXiv 2406.16170 ↗First posted 23 Jun 2024cs.IR cs.AIcited by 4

Not on the map. Why?

Abstract (arXiv)

The learning objective is integral to collaborative filtering systems, where the Bayesian Personalized Ranking (BPR) loss is widely used for learning informative backbones. However, BPR often experiences slow convergence and suboptimal local optima, partially because it only considers one negative item for each positive item, neglecting the potential impacts of other unobserved items. To address this issue, the recently proposed Sampled Softmax Cross-Entropy (SSM) compares one positive sample with multiple negative samples, leading to better performance. Our comprehensive experiments confirm that recommender systems consistently benefit from multiple negative samples during training. Furthermore, we introduce a underlineSimplified Sampled Softmax underlineCross-underlineEntropy Loss (SimCE), which simplifies the SSM using its upper bound. Our validation on 12 benchmark datasets, using both MF and LightGCN backbones, shows that SimCE significantly outperforms both BPR and SSM.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 16 of its 44 references that are in the map. First posted on arXiv 23 Jun 2024.

Builds on

16 of 44 references.

References · 16

  1. 2020LightGCN: Simplifying and Powering Graph Convolution Network for Recommendationcited by 1,134
  2. 2017Neural Collaborative Filteringcited by 1,108
  3. 2019BERT4Rec: Sequential Recommendation with Bidirectional Encoder Representations from Transformercited by 952
  4. 2019Neural Graph Collaborative Filteringcited by 660
  5. 2018Variational Autoencoders for Collaborative Filteringcited by 308
  6. 2024LLM Maybe LongLM: Self-Extend LLM Context Window Without Tuningcited by 133
  7. 2021UltraGCN: Ultra Simplification of Graph Convolutional Networks for Recommendationcited by 87
  8. 2020Understanding Negative Sampling in Graph Representation Learningcited by 66
  9. 2021SimpleX: A Simple and Strong Baseline for Collaborative Filteringcited by 65
  10. 2019POG: Personalized Outfit Generation for Fashion Recommendation at Alibaba iFashioncited by 63
  11. 2022Towards Representation Alignment and Uniformity in Collaborative Filteringcited by 57
  12. 2023Turning Dross Into Gold Loss: is BERT4Rec really better than SASRec?cited by 30
4 more
  1. 2023Towards Mitigating Dimensional Collapse of Representations in Collaborative Filteringcited by 10
  2. 2023Toward a Better Understanding of Loss Functions for Collaborative Filteringcited by 8
  3. 2023Enhancing Transformers without Self-supervised Learning: A Loss Landscape Perspective in Sequential Recommendationcited by 3
  4. 2024Can One Embedding Fit All? A Multi-Interest Learning Paradigm Towards Improving User Interest Diversity Fairnesscited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 1; 2025: 0; 2026: 3.

4 papers.