REVIEW 10 cited by
Generative Sequential Recommendation with GPTRec
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Generative Sequential Recommendation with GPTRec
read the original abstract
Sequential recommendation is an important recommendation task that aims to predict the next item in a sequence. Recently, adaptations of language models, particularly Transformer-based models such as SASRec and BERT4Rec, have achieved state-of-the-art results in sequential recommendation. In these models, item ids replace tokens in the original language models. However, this approach has limitations. First, the vocabulary of item ids may be many times larger than in language models. Second, the classical Top-K recommendation approach used by these models may not be optimal for complex recommendation objectives, including auxiliary objectives such as diversity, coverage or coherence. Recent progress in generative language models inspires us to revisit generative approaches to address these challenges. This paper presents the GPTRec sequential recommendation model, which is based on the GPT-2 architecture. GPTRec can address large vocabulary issues by splitting item ids into sub-id tokens using a novel SVD Tokenisation algorithm based on quantised item embeddings from an SVD decomposition of the user-item interaction matrix. The paper also presents a novel Next-K recommendation strategy, which generates recommendations item-by-item, considering already recommended items. The Next-K strategy can be used for producing complex interdependent recommendation lists. We experiment with GPTRec on the MovieLens-1M dataset and show that using sub-item tokenisation GPTRec can match the quality of SASRec while reducing the embedding table by 40%. We also show that the recommendations generated by GPTRec on MovieLens-1M using the Next-K recommendation strategy match the quality of SASRec in terms of NDCG@10, meaning that the model can serve as a strong starting point for future research.
Forward citations
Cited by 10 Pith papers
-
Learning Variable-Length Tokenization for Generative Recommendation
VarLenRec learns variable-length semantic IDs for generative recommendation by allocating longer codes to tail items via popularity-weighted information budget allocation, hyperbolic residual quantization, and a diffe...
-
MLPs are Efficient Distilled Generative Recommenders
SID-MLP distills autoregressive generative recommenders into efficient position-specific MLP heads for Semantic ID tasks, achieving 8.74x faster inference with matching accuracy.
-
VaLiDRec: Variable-Length LLM-Aligned Semantic IDs for Generative Recommendation
VaLiDRec constructs variable-length item IDs from native LLM vocabulary tokens and predicts them in parallel, outperforming fixed-code semantic-ID recommenders on four Amazon datasets.
-
Generative Long-term User Interest Modeling for Click-Through Rate Prediction
GenLI generates diverse target-independent interest distributions via an IGM, retrieves behaviors with O(1) lookup in BRM, and fuses via IFM gating to balance accuracy and efficiency in CTR prediction.
-
RoTE: Coarse-to-Fine Multi-Level Rotary Time Embedding for Sequential Recommendation
RoTE is a multi-level rotary time embedding module that explicitly models time spans in sequential recommendation and improves NDCG@5 by up to 20.11% when added to standard backbones on public benchmarks.
-
TSUBASA: Improving Long-Horizon Personalization via Evolving Memory and Self-Learning with Context Distillation
TSUBASA improves long-horizon personalization in LLMs via dynamic memory evolution for writing and context-distillation self-learning for reading, outperforming Mem0 and Memory-R1 on Qwen-3 benchmarks while reducing t...
-
DeepInterestGR: Mining Deep Multi-Interest Using Multi-Modal LLMs for Generative Recommendation
Using LLM-mined 'deep interests' as semantic IDs and as a reinforcement-learning reward gives reported 9-15% relative HR/NDCG gains in sequential recommendation, though the paper lacks code, error bars, and a cross-do...
-
Bi-Level Optimization for Generative Recommendation: Bridging Tokenization and Generation
BLOGER is a bi-level optimization framework that jointly optimizes the tokenizer and recommender for generative recommendation, outperforming prior methods on real-world datasets.
-
Sequential Data Augmentation for Generative Recommendation
GenPAS unifies common data augmentation strategies for generative recommendation as special cases of a bias-controlled stochastic sampling process and demonstrates gains in accuracy, data efficiency, and parameter eff...
-
Efficient LLM-based Advertising via Model Compression and Parallel Verification
An Efficient Generative Targeting framework accelerates LLM inference in advertising via adaptive group quantization, layer-adaptive hierarchical sparsification, and prefix-tree parallel verification while accepting l...
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.