RecJPQ: Training Large-Catalogue Sequential Recommenders
Not on the map. Why?
Abstract (arXiv)
Sequential Recommendation is a popular recommendation task that uses the order of user-item interaction to model evolving users' interests and sequential patterns in their behaviour. Current state-of-the-art Transformer-based models for sequential recommendation, such as BERT4Rec and SASRec, generate sequence embeddings and compute scores for catalogue items, but the increasing catalogue size makes training these models costly. The Joint Product Quantisation (JPQ) method, originally proposed for passage retrieval, markedly reduces the size of the retrieval index with minimal effect on model effectiveness, by replacing passage embeddings with a limited number of shared sub-embeddings. This paper introduces RecJPQ, a novel adaptation of JPQ for sequential recommendations, which takes the place of item embeddings tensor and replaces item embeddings with a concatenation of a limited number of shared sub-embeddings and, therefore, limits the number of learnable model parameters. The main idea of RecJPQ is to split items into sub-item entities before training the main recommendation model, which is inspired by splitting words into tokens and training tokenisers in language models. We apply RecJPQ to SASRec, BERT4Rec, and GRU4rec models on three large-scale sequential datasets. Our results showed that RecJPQ could notably reduce the model size (e.g., 48% reduction for the Gowalla dataset with no effectiveness degradation). RecJPQ can also improve model performance through a regularisation effect (e.g. +0.96% NDCG@10 improvement on the Booking.com dataset). Overall, RecJPQ allows the training of state-of-the-art transformer recommenders in industrial applications, where datasets with millions of items are common.
Key facts. Cited by 8 papers in the map (data through 7 Oct 2026). First posted on arXiv 11 Dec 2023.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2024: 1; 2025: 4; 2026: 3.
8 papers.
- 2025DiffGRM: Diffusion-based Generative Recommendation Modelcited by 4
- 2025From Past To Path: Masked History Learning for Next-Item Prediction in Generative Recommendationcited by 2
- 2025Balancing Accuracy and Novelty with Sub-Item Popularitycited by 1
- 2026Asymmetric Generative Recommendation via Kronecker Residual Bridge and Multi-Faceted Hierarchical Quantizationcited by 1
- 2024Aligning GPTRec with Beyond-Accuracy Goals with Reinforcement Learningcited by 0
- 2025Semantic IDs for Music Recommendationcited by 0
- 2026MALLOC: Benchmarking the Memory-aware Long Sequence Compression for Large Sequential Recommendationcited by 0
- 2026Deep Interest Mining for Intent-Enriched Semantic IDs in Multimodal Generative Recommendationcited by 0
- 2026Asymmetric Generative Recommendation via Kronecker Residual Bridge and Multi-Faceted Hierarchical Quantization14 May 2026
- 2026Deep Interest Mining for Intent-Enriched Semantic IDs in Multimodal Generative Recommendation3 Mar 2026
- 2026MALLOC: Benchmarking the Memory-aware Long Sequence Compression for Large Sequential Recommendation28 Jan 2026
- 2025DiffGRM: Diffusion-based Generative Recommendation Model21 Oct 2025
- 2025From Past To Path: Masked History Learning for Next-Item Prediction in Generative Recommendation28 Sep 2025
- 2025Balancing Accuracy and Novelty with Sub-Item Popularity7 Aug 2025
- 2025Semantic IDs for Music Recommendation24 Jul 2025
- 2024Aligning GPTRec with Beyond-Accuracy Goals with Reinforcement Learning7 Mar 2024