用分层策略提升生成式推荐对长期兴趣的建模能力
Coarse-to-Fine Long-term Interest Modeling for Generative Recommendation
- 先粗后细建模用户长期行为,通过语义编码压缩历史序列
- 在淘宝和快收数据集上显著超越现有方法,提升推荐精度
- 适合研究生成式推荐与用户行为建模的学者和工程师
利用用户的长期行为模式是提升现代推荐系统准确性的关键路径。尽管生成式推荐系统已成为一种变革性范式,但在有效建模长序列历史行为方面仍面临挑战。为此,我们提出GLASS框架,通过SID-Tier和语义搜索将长期用户兴趣融入生成过程。首先引入SID-Tier模块,将长期交互映射为统一兴趣向量,以增强初始SID token的预测。不同于传统检索模型在大规模物品空间中的困难,SID-Tier利用语义码本的紧凑性,融合用户长期历史与候选语义码之间的跨特征。此外,我们提出语义硬搜索,使用生成的粗粒度语义ID作为动态键,提取相关历史行为,并通过自适应门控融合模块重新校准后续细粒度token的轨迹。为应对语义硬搜索中的固有数据稀疏性,我们提出两种策略:语义邻域增强和码本扩容。在两个大规模真实世界数据集TAOBAO-MM和KuaiRec上的大量实验表明,GLASS显著优于现有最优基线,显著提升推荐质量。代码已公开,以促进生成式推荐研究。
原文摘要 · Abstract (English)
Leveraging long-term user behavioral patterns is a key trajectory for enhancing the accuracy of modern recommender systems. While generative recommender systems have emerged as a transformative paradigm, they face hurdles in effectively modeling extensive historical sequences. To address this challenge, we propose GLASS, a novel framework that integrates long-term user interests into the generative process via SID-Tier and Semantic Search. We first introduce SID-Tier, a module that maps long-term interactions into a unified interest vector to enhance the prediction of the initial SID token. Unlike traditional retrieval models that struggle with massive item spaces, SID-Tier leverages the compact nature of the semantic codebook to incorporate cross features between the user's long-term history and candidate semantic codes. Furthermore, we present semantic hard search, which utilizes generated coarse-grained semantic ID as dynamic keys to extract relevant historical behaviors, which are then fused via an adaptive gated fusion module to recalibrate the trajectory of subsequent fine-grained tokens. To address the inherent data sparsity in semantic hard search, we propose two strategies: semantic neighbor augmentation and codebook resizing. Extensive experiments on two large-scale real-world datasets, TAOBAO-MM and KuaiRec, demonstrate that GLASS outperforms state-of-the-art baselines, achieving significant gains in recommendation quality. Our codes are made publicly available to facilitate further research in generative recommendation.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。