mlsanityData to 7 Oct 2026

To Copy, or not to Copy; That is a Critical Issue of the Output Softmax Layer in Neural Sequential Recommenders

arXiv 2310.14079 ↗First posted 21 Oct 2023cs.IR cs.AI cs.LGcited by 2

Not on the map. Why?

Abstract (arXiv)

Recent studies suggest that the existing neural models have difficulty handling repeated items in sequential recommendation tasks. However, our understanding of this difficulty is still limited. In this study, we substantially advance this field by identifying a major source of the problem: the single hidden state embedding and static item embeddings in the output softmax layer. Specifically, the similarity structure of the global item embeddings in the softmax layer sometimes forces the single hidden state embedding to be close to new items when copying is a better choice, while sometimes forcing the hidden state to be close to the items from the input inappropriately. To alleviate the problem, we adapt the recently-proposed softmax alternatives such as softmax-CPR to sequential recommendation tasks and demonstrate that the new softmax architectures unleash the capability of the neural encoder on learning when to copy and when to exclude the items from the input sequence. By only making some simple modifications on the output softmax layer for SASRec and GRU4Rec, softmax-CPR achieves consistent improvement in 12 datasets. With almost the same model size, our best method not only improves the average NDCG@10 of GRU4Rec in 5 datasets with duplicated items by 10% (4%-17% individually) but also improves 7 datasets without duplicated items by 24% (8%-39%)!

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 23 of its 53 references that are in the map. First posted on arXiv 21 Oct 2023.

Builds on

23 of 53 references.

References · 23

  1. 2016Gaussian Error Linear Units (GELUs)cited by 3,431
  2. 2018Self-Attentive Sequential Recommendationcited by 1,169
  3. 2020ColBERT: Efficient and Effective Passage Search via Contextualized Late Interaction over BERTcited by 1,160
  4. 2015Image-based Recommendations on Styles and Substitutescited by 702
  5. 2015Session-based Recommendations with Recurrent Neural Networkscited by 685
  6. 2016Incorporating Copying Mechanism in Sequence-to-Sequence Learningcited by 217
  7. 2020Sparse, Dense, and Attentional Representations for Text Retrievalcited by 213
  8. 2017Breaking the Softmax Bottleneck: A High-Rank RNN Language Modelcited by 147
  9. 2020RecBole: Towards a Unified, Comprehensive and Efficient Framework for Recommendation Algorithmscited by 137
  10. 2020Neural Collaborative Filtering vs. Matrix Factorization Revisitedcited by 123
  11. 2019A Troubling Analysis of Reproducibility and Progress in Recommender Systems Researchcited by 65
  12. 2021A Survey on Accuracy-oriented Neural Recommendation: From Collaborative Filtering to Information-rich Recommendationcited by 59
11 more
  1. 2018Sequence-Aware Recommender Systemscited by 58
  2. 2018RepeatNet: A Repeat Aware Neural Recommendation Machine for Session-based Recommendationcited by 51
  3. 2023Turning Dross Into Gold Loss: is BERT4Rec really better than SASRec?cited by 30
  4. 2021A Next Basket Recommendation Reality Checkcited by 15
  5. 2021Personalized Embedding-based e-Commerce Recommendations at eBaycited by 12
  6. 2023Bridging Dense and Sparse Maximum Inner Product Searchcited by 8
  7. 2023Revisiting the Architectures like Pointer Networks to Efficiently Improve the Next Word Distribution, Summarization Factuality, and Beyondcited by 7
  8. 2023Masked and Swapped Sequence Modeling for Next Novel Basket Recommendation in Grocery Shoppingcited by 7
  9. 2017Attention-based Mixture Density Recurrent Networks for History-based Recommendationcited by 3
  10. 2021Breaking the Softmax Bottleneck for Sequential Recommender Systems with Dropout and Decouplingcited by 3
  11. 2017Mixture-of-tastes Models for Representing Users with Diverse Interestscited by 1

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 1; 2026: 1.

2 papers.