用可学习的个性化标记压缩用户历史,提升推荐效率与准确率
Efficient Sequential Recommendation for Long Term User Interest Via Personalization
- 将长用户行为序列压缩为可学习的个性化标记
- 在多个模型上降低计算成本,推荐精度保持高位
- 适合需要高效处理长期用户兴趣的工业级推荐系统
近年来,序列建模、生成式推荐和大语言模型在推荐领域取得成功。尽管序列模型的规模定律已被验证,但其变换器架构的非线性(二次)增长特性导致在实际推荐应用中计算效率低下。为提升序列模型效率,本文提出一种基于个性化技术的新方法:将长用户交互历史压缩为可学习的标记,并与近期交互结合生成推荐。该方法显著降低计算开销,同时保持高推荐精度。本方法可兼容现有基于Transformer的推荐模型,如HSTU和HLLM。在多个序列模型上的大量实验验证了其通用性与有效性。源代码已公开于https://github.com/facebookresearch/PerSRec。
原文摘要 · Abstract (English)
Recent years have witnessed success of sequential modeling, generative recommender, and large language model for recommendation. Though the scaling law has been validated for sequential models, it showed inefficiency in computational capacity when considering real-world applications like recommendation, due to the non-linear(quadratic) increasing nature of the transformer model. To improve the efficiency of the sequential model, we introduced a novel approach to sequential recommendation that leverages personalization techniques to enhance efficiency and performance. Our method compresses long user interaction histories into learnable tokens, which are then combined with recent interactions to generate recommendations. This approach significantly reduces computational costs while maintaining high recommendation accuracy. Our method could be applied to existing transformer based recommendation models, e.g., HSTU and HLLM. Extensive experiments on multiple sequential models demonstrate its versatility and effectiveness. Source code is available at \href{https://github.com/facebookresearch/PerSRec}{https://github.com/facebookresearch/PerSRec}.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。