paper-with-me

Papers

RecJPQ: Training Large-Catalogue Sequential Recommenders

2023-12-11 · Aleksandr V. Petrov, Craig Macdonald

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.

📄 PDF Abstract BibTeX arXiv:2312.06165

Code (1)

asash/recjpq 공식 구현 tf

Tasks

Passage RetrievalRecommendation SystemsRetrievalSequential Recommendation

Similar Papers 제목 키워드 기반

Efficient Inference of Sub-Item Id-based Sequential Recommendation Models with Millions of Items

2024-08-19 · Aleksandr V. Petrov, Craig Macdonald, Nicola Tonellotto

Transformer-based recommender systems, such as BERT4Rec or SASRec, achieve state-of-the-art results in sequential recommendation. However, it is challenging to use these models in production environments with catalogues …

Recommendation SystemsSequential Recommendation

Efficient Recommendation with Millions of Items by Dynamic Pruning of Sub-Item Embeddings

2025-05-01 · Aleksandr V. Petrov, Craig Macdonald, Nicola Tonellotto

A large item catalogue is a major challenge for deploying modern sequential recommender models, since it makes the memory footprint of the model large and increases inference latency. One promising approach to address th…

Balancing Accuracy and Novelty with Sub-Item Popularity

2025-08-07 · Chiara Mallamaci, Aleksandr Vladimirovich Petrov, Alberto Carlo Maria Mancino, Vito Walter Anelli 외 arxiv

In the realm of music recommendation, sequential recommenders have shown promise in capturing the dynamic nature of music consumption. A key characteristic of this domain is repetitive listening, where users frequently r…

Item Recommendation from Implicit Feedback

2021-01-21 · Steffen Rendle

The task of item recommendation is to select the best items for a user from a large catalogue of items. Item recommenders are commonly trained from implicit feedback which consists of past actions that are positive only.…

Retrieval

RECE: Reduced Cross-Entropy Loss for Large-Catalogue Sequential Recommenders

2024-08-05 · Danil Gusak, Gleb Mezentsev, Ivan Oseledets, Evgeny Frolov

Scalability is a major challenge in modern recommender systems. In sequential recommendations, full Cross-Entropy (CE) loss achieves state-of-the-art recommendation quality but consumes excessive GPU memory with large it…

GPURecommendation Systems