用检索增强解决用户偏好漂移和长尾遗忘问题
RaSeRec: Retrieval-Augmented Sequential Recommendation
- 构建动态记忆库,通过检索补充用户建模
- 在三个数据集上显著提升推荐效果
- 适合需要捕捉用户长期偏好的场景
尽管主流的监督与自监督增强序列推荐模型借助强大神经网络架构取得了良好性能,但仍存在两大局限:(1) 偏好漂移,即基于历史数据训练的模型难以适应用户偏好的演化;(2) 隐式记忆,即头部模式主导参数学习,导致长尾项目难以被召回。本文探索在序列推荐中引入检索增强机制,提出名为RaSeRec的框架。核心思想是维护一个动态记忆库以应对偏好漂移,并显式检索相关记忆来增强用户建模。该框架包含两个阶段:(i) 基于协同过滤的预训练,同时学习推荐与检索;(ii) 检索增强的微调,学习如何利用检索到的记忆。在三个数据集上的大量实验充分验证了RaSeRec的优越性与有效性。实现代码已公开于https://github.com/HITsz-TMG/RaSeRec。
原文摘要 · Abstract (English)
Although prevailing supervised and self-supervised learning augmented sequential recommendation (SeRec) models have achieved improved performance with powerful neural network architectures, we argue that they still suffer from two limitations: (1) Preference Drift, where models trained on past data can hardly accommodate evolving user preference; and (2) Implicit Memory, where head patterns dominate parametric learning, making it harder to recall long tails. In this work, we explore retrieval augmentation in SeRec, to address these limitations. Specifically, we propose a Retrieval-Augmented Sequential Recommendation framework, named RaSeRec, the main idea of which is to maintain a dynamic memory bank to accommodate preference drifts and retrieve relevant memories to augment user modeling explicitly. It consists of two stages: (i) collaborative-based pre-training, which learns to recommend and retrieve; (ii) retrieval-augmented fine-tuning, which learns to leverage retrieved memories. Extensive experiments on three datasets fully demonstrate the superiority and effectiveness of RaSeRec. The implementation code is available at https://github.com/HITsz-TMG/RaSeRec.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。