用Transformer扩展推荐系统,发现其性能随规模增长的规律。
Scaling Sequential Recommendation Models with Transformers
- 基于全量亚马逊商品数据,探索推荐模型的规模效应。
- 模型越大、数据越多,推荐准确率越高,且可迁移至小场景任务。
- 为实际推荐系统提供训练与部署的高效策略参考。
用户偏好建模主要依赖于用户与系统中各类元素的历史交互记录。基于历史数据个性化推荐内容是序列推荐的核心目标。由于该问题的特性及在多个领域展现出的良好性能,促使研究者采用Transformer架构,该架构在伴随参数量增加时能有效利用更大规模训练数据。这种规模效应受到广泛关注,为构建更大模型提供了设计和训练指导。受大语言模型缩放定律启发,我们研究了序列推荐中的类似规律。使用未被充分探索的完整Amazon Product Data数据集,揭示了与语言模型相似的缩放行为。计算最优训练可行,但需细致分析特定应用下的算力-性能权衡。我们还表明,大规模预训练模型的性能提升可通过微调迁移到更小的任务域。本方法与发现为真实高维偏好空间中的模型训练与部署提供了战略路线图,有助于提升训练与推理效率。我们希望本文弥合Transformer潜力与现实推荐系统中高维序列推荐固有复杂性之间的差距。代码与模型见:https://github.com/mercadolibre/srt
原文摘要 · Abstract (English)
Modeling user preferences has been mainly addressed by looking at users' interaction history with the different elements available in the system. Tailoring content to individual preferences based on historical data is the main goal of sequential recommendation. The nature of the problem, as well as the good performance observed across various domains, has motivated the use of the transformer architecture, which has proven effective in leveraging increasingly larger amounts of training data when accompanied by an increase in the number of model parameters. This scaling behavior has brought a great deal of attention, as it provides valuable guidance in the design and training of even larger models. Taking inspiration from the scaling laws observed in training large language models, we explore similar principles for sequential recommendation. We use the full Amazon Product Data dataset, which has only been partially explored in other studies, and reveal scaling behaviors similar to those found in language models. Compute-optimal training is possible but requires a careful analysis of the compute-performance trade-offs specific to the application. We also show that performance scaling translates to downstream tasks by fine-tuning larger pre-trained models on smaller task-specific domains. Our approach and findings provide a strategic roadmap for model training and deployment in real high-dimensional preference spaces, facilitating better training and inference efficiency. We hope this paper bridges the gap between the potential of transformers and the intrinsic complexities of high-dimensional sequential recommendation in real-world recommender systems. Code and models can be found at https://github.com/mercadolibre/srt
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。