mlsanityData to 7 Oct 2026

Improving Sequential Recommendation Models with an Enhanced Loss Function

arXiv 2301.00979 ↗First posted 3 Jan 2023cs.IR cs.LGcited by 1

Not on the map. Why?

Abstract (arXiv)

There has been a growing interest in benchmarking sequential recommendation models and reproducing/improving existing models. For example, Rendle et al. improved matrix factorization models by tuning their parameters and hyperparameters. Petrov and Macdonald developed a more efficient and effective implementation of BERT4Rec, which resolved inconsistencies in performance comparison between BERT4Rec and SASRec in previous works. In particular, BERT4Rec and SASRec share a similar network structure, with the main difference lying in their training objective/loss function. Therefore, we analyzed the advantages and disadvantages of commonly used loss functions in sequential recommendation and proposed an improved loss function that leverages their strengths. We conduct extensive experiments on two influential open-source libraries, and the results demonstrate that our improved loss function significantly enhances the performance of GRU4Rec, SASRec, SR-GNN, and S3Rec models, improving their benchmarks significantly. Furthermore, the improved SASRec benchmark outperforms BERT4Rec on the ML-1M and Beauty datasets and achieves similar results to BERT4Rec on the ML-20M and Steam datasets. We also reproduce the results of the BERT4Rec model on the Beauty dataset. Finally, we provide a comprehensive explanation of the effectiveness of our improved loss function through experiments. Our code is publicly available at https://github.com/Li-fAngyU/sequential_rec.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 23 of its 33 references that are in the map. First posted on arXiv 3 Jan 2023.

Builds on

23 of 33 references.

References · 23

  1. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  2. 2021Swin Transformer: Hierarchical Vision Transformer using Shifted Windowscited by 12,082
  3. 2018Self-Attentive Sequential Recommendationcited by 1,169
  4. 2019BERT4Rec: Sequential Recommendation with Bidirectional Encoder Representations from Transformercited by 952
  5. 2015Image-based Recommendations on Styles and Substitutescited by 702
  6. 2015Session-based Recommendations with Recurrent Neural Networkscited by 685
  7. 2018Personalized Top-N Sequential Recommendation via Convolutional Sequence Embeddingcited by 473
  8. 2018Session-based Recommendation with Graph Neural Networkscited by 312
  9. 2020S^3-Rec: Self-Supervised Learning for Sequential Recommendation with Mutual Information Maximizationcited by 311
  10. 2017Neural Attentive Session-based Recommendationcited by 237
  11. 2017Recurrent Neural Networks with Top-k Gains for Session-based Recommendationscited by 165
  12. 2019Hierarchical Gating Networks for Sequential Recommendationcited by 101
11 more
  1. 2020Exploring Data Splitting Strategies for the Evaluation of Recommendation Modelscited by 48
  2. 2019Memory Augmented Graph Neural Networks for Sequential Recommendationcited by 46
  3. 2021Non-invasive Self-attention for Side Information Fusion in Sequential Recommendationcited by 39
  4. 2021A Case Study on Sampling Strategies for Evaluating Neural Sequential Item Recommendation Modelscited by 24
  5. 2022A Systematic Review and Replicability Study of BERT4Rec for Sequential Recommendationcited by 22
  6. 2021Revisiting the Performance of iALS on Item Recommendation Benchmarkscited by 21
  7. 2022Effective and Efficient Training for Sequential Recommendation using Recency Samplingcited by 13
  8. 2022Coarse-to-Fine Sparse Sequential Recommendationcited by 8
  9. 2021Extracting Attentive Social Temporal Excitation for Sequential Recommendationcited by 5
  10. 2019Sequential Recommendation with Relation-Aware Kernelized Self-Attentioncited by 3
  11. 2022ELECRec: Training Sequential Recommenders as Discriminatorscited by 3

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.