Autoregressive Generation Strategies for Top-K Sequential Recommendations
Not on the map. Why?
Abstract (arXiv)
The goal of modern sequential recommender systems is often formulated in terms of next-item prediction. In this paper, we explore the applicability of generative transformer-based models for the Top-K sequential recommendation task, where the goal is to predict items a user is likely to interact with in the "near future". We explore commonly used autoregressive generation strategies, including greedy decoding, beam search, and temperature sampling, to evaluate their performance for the Top-K sequential recommendation task. In addition, we propose novel Reciprocal Rank Aggregation (RRA) and Relevance Aggregation (RA) generation strategies based on multi-sequence generation with temperature sampling and subsequent aggregation. Experiments on diverse datasets give valuable insights regarding commonly used strategies' applicability and show that suggested approaches improve performance on longer time horizons compared to widely-used Top-K prediction approach and single-sequence autoregressive generation strategies.
Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 25 of its 66 references that are in the map. First posted on arXiv 26 Sep 2024.
Builds on
25 of 66 references.
References · 25
- 2020Language Models are Few-Shot Learnerscited by 32,419
- 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,599
- 2019The Curious Case of Neural Text Degenerationcited by 2,916
- 2019HuggingFace's Transformers: State-of-the-art Natural Language Processingcited by 2,218
- 2018Hierarchical Neural Story Generationcited by 1,193
- 2018Self-Attentive Sequential Recommendationcited by 1,184
- 2019BERT4Rec: Sequential Recommendation with Bidirectional Encoder Representations from Transformercited by 964
- 2018Personalized Top-N Sequential Recommendation via Convolutional Sequence Embeddingcited by 476
- 2022Recommendation as Language Processing (RLP): A Unified Pretrain, Personalized Prompt & Predict Paradigm (P5)cited by 402
- 2016Diverse Beam Search: Decoding Diverse Solutions from Neural Sequence Modelscited by 301
- 2023GPT4Rec: A Generative Framework for Personalized Recommendation and User Interests Interpretationcited by 103
- 2016Yelp Dataset Challenge: Review Rating Predictioncited by 84
13 more
- 2018Sequence-Aware Recommender Systemscited by 58
- 2020Consistency of a Recurrent Language Model With Respect to Incomplete Decodingcited by 54
- 2023Turning Dross Into Gold Loss: is BERT4Rec really better than SASRec?cited by 30
- 2023gSASRec: Reducing Overconfidence in Sequential Recommendation Trained with Negative Samplingcited by 29
- 2022A Systematic Review and Replicability Study of BERT4Rec for Sequential Recommendationcited by 22
- 2023Widespread Flaws in Offline Evaluation of Recommender Systemscited by 22
- 2019Personalized Bundle List Recommendationcited by 21
- 2020MEANTIME: Mixture of Attention Mechanisms with Multi-temporal Embeddings for Sequential Recommendationcited by 17
- 2023Scaling Session-Based Transformer Recommendations using Optimized Negative Sampling and Loss Functionscited by 9
- 2024RECE: Reduced Cross-Entropy Loss for Large-Catalogue Sequential Recommenderscited by 9
- 2020KATRec: Knowledge Aware aTtentive Sequential Recommendationscited by 4
- 2023Integrating Item Relevance in Training Loss for Sequential Recommender Systemscited by 4
- 2018Recurrent Neural Networks for Long and Short-Term Sequential Recommendationcited by 3
Built on by
Citing papers per year: 2025: 3; 2026: 2.
5 papers.
- 2025Time to Split: Exploring Data Splitting Strategies for Offline Evaluation of Sequential Recommenderscited by 12
- 2025Recommendation Is a Dish Better Served Warmcited by 2
- 2025Maximum Impact with Fewer Features: Efficient Feature Selection for Cold-Start Recommenders through Collaborative Importance Weightingcited by 1
- 2026SplitLight: An Exploratory Toolkit for Recommender Systems Datasets and Splitscited by 0
- 2026Jump Start or False Start? A Theoretical and Empirical Evaluation of LLM-initialized Banditscited by 0
- 2026Jump Start or False Start? A Theoretical and Empirical Evaluation of LLM-initialized Bandits2 Apr 2026
- 2026SplitLight: An Exploratory Toolkit for Recommender Systems Datasets and Splits22 Feb 2026
- 2025Recommendation Is a Dish Better Served Warm11 Aug 2025
- 2025Maximum Impact with Fewer Features: Efficient Feature Selection for Cold-Start Recommenders through Collaborative Importance Weighting8 Aug 2025
- 2025Time to Split: Exploring Data Splitting Strategies for Offline Evaluation of Sequential Recommenders22 Jul 2025