用卷积网络高效建模用户序列偏好,提升推荐精度与速度
Rethinking Convolutional Networks for Attribute-Aware Sequential Recommendation

- 采用分层下采样卷积结构,实现线性复杂度的序列表征
- 在四个真实数据集上超越主流模型,长序列处理能力更强
- 适合需要高效处理长用户历史的推荐系统场景
属性感知的序列推荐旨在基于用户历史交互记录(含物品属性)预测其下一步行为。现有方法多依赖自注意力机制将整个序列聚合为统一表征,虽有效但存在计算复杂度高、内存消耗大问题,难以处理长序列,影响对长期偏好的捕捉。此外,纯注意力建模可能无法最优提取序列模式。本文提出ConvRec,一种具有线性计算与内存复杂度的卷积架构,通过分层下采样卷积逐步聚合邻近物品,生成紧凑而丰富的序列表征。实验在四个真实数据集上验证其有效性,性能优于当前最优模型,证明卷积结构在推荐系统中高效建模序列的潜力。代码与数据集已公开于https://github.com/ismll-research/ConvRec。
原文摘要 · Abstract (English)
Attribute-aware sequential recommendation entails predicting the next item a user will interact with based on a chronologically ordered history of past interactions, enriched with item attributes. Existing methods typically leverage self-attention mechanisms to aggregate the entire sequence into a unified representation used for next-item prediction. While effective, these models often suffer from high computational complexity and memory consumption, limiting their ability to process long user histories. This constraint restricts the model's capacity to fully capture long-term user preferences. In some scenarios, modeling item interactions purely through attention may also not be the most effective approach to extract sequential patterns. In this work, we propose ConvRec, an alternative method with linear computational and memory complexity that employs convolutional layers in a hierarchical, down-scaled fashion to generate compact, yet expressive sequence representations. To further enhance the model's ability to capture diverse sequential patterns, each layer aggregates the neighboring items gradually to reach a comprehensive sequence representation. Extensive experiments on four real-world datasets demonstrate that our approach outperforms state-of-the-art sequential recommendation models, highlighting the potential of convolution-based architectures for efficient and effective sequence modeling in recommendation systems. Our implementation code and datasets are available here https://github.com/ismll-research/ConvRec.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。