用滑动窗口实现长序列推荐,开源可复现且适合普通设备训练
Is Sliding Window All You Need? An Open Framework for Long-Sequence Recommendation

- 提出滑动窗口框架,支持在普通GPU上训练长序列推荐
- 在Retailrocket数据集上提升6.04% MRR,训练耗时仅增加4倍
- 新嵌入层让百万级词表在消费级显卡上运行,精度几乎无损
长交互历史对现代推荐系统至关重要,但受限于内存和延迟预算,长期序列训练常被视为不切实际。本文证明其不仅可行,而且有效——在学术规模下实现。我们发布了一个完整的端到端框架,包含数据处理、训练和评估全流程脚本,支持工业级长序列训练的滑动窗口方法。除了复现已有成果,还补充了两项关键能力:(i) 基于运行时感知的消融实验,量化不同窗口策略与步幅下的准确率-计算成本权衡;(ii) 一种新型k-shift嵌入层,在消费级GPU上实现百万级词表,精度损失可忽略。该框架可在普通高校集群稳定训练,带来显著性能提升(如Retailrocket上MRR最高+6.04%,Recall@10最高+6.34%),训练时间仅增加约4倍。通过提供可靠流程、公开训练耗时,并引入低资源适配的嵌入机制,将长序列训练从封闭的工业技术转变为开放、可扩展的社区方法。
原文摘要 · Abstract (English)
Long interaction histories are central to modern recommender systems, yet training with long sequences is often dismissed as impractical under realistic memory and latency budgets. This work demonstrates that it is not only practical but also effective-at academic scale. We release a complete, end-to-end framework that implements industrial-style long-sequence training with sliding windows, including all data processing, training, and evaluation scripts. Beyond reproducing prior gains, we contribute two capabilities missing from earlier reports: (i) a runtime-aware ablation study that quantifies the accuracy-compute frontier across windowing regimes and strides, and (ii) a novel k-shift embedding layer that enables million-scale vocabularies on commodity GPUs with negligible accuracy loss. Our implementation trains reliably on modest university clusters while delivering competitive retrieval quality (e.g., up to +6.04% MRR and +6.34% Recall@10 on Retailrocket) with $\sim 4 \times $ training-time overheads. By packaging a robust pipeline, reporting training time costs, and introducing an embedding mechanism tailored for low-resource settings, we transform long-sequence training from a closed, industrial technique into a practical, open, and extensible methodology for the community.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。