arXiv:2609.06219cs.IR2026-09

解决推荐系统长短期行为差距问题,无需缓存用户历史。

Closing the Long-Short View Gap in Sequential Recommendation without Cached History

论文配图:Closing the Long-Short View Gap in Sequential Recommendation without Cached History
图 1 · 摘自论文原文
  • 用角度相似度替代点积,缓解序列位置偏差。
  • 仅微调偏置和层归一化,提升短序列性能。
  • 适合实时推荐场景,冷启动也有效。

序列推荐模型通常在长用户行为序列上训练以捕捉丰富信号,但在推理时受限于实时效率,难以使用完整历史。直接采用近期行为会导致性能显著下降。现有方法通过持久化用户状态来缓解该问题,但带来基础设施开销,且对冷启动场景帮助有限。本文实证发现两个源于几何特性与数据稀疏性的结构缺陷,并提出两阶段框架来弥合长-短视图性能差距。第一阶段,将常用的点积替换为角度相似度评分,并改进softmax以缓解前缀位置偏差;第二阶段,仅微调标准序列模型中通用的偏置与层归一化组件,实现进一步优化。两个阶段均由精心设计的学习目标引导。在三个公开数据集上,针对两种代表性骨干模型的大量实验验证了该框架的有效性。

原文摘要 · Abstract (English)

Sequential recommenders are typically trained on long user histories to capture rich behavioral signals, yet serving with training-length sequences is often impractical due to real-time efficiency constraints. Directly using only recent behaviors leads to a severe performance drop. To bridge this gap, existing approaches compress user histories into persistent per-user states, storing and retrieving them at inference time; while effective, they impose non-trivial infrastructure overhead and offer little remedy in cold-start scenarios. In this paper, we empirically identify two structural flaws rooted in geometric properties and dataset sparsity, and propose a novel two-stage framework to close the long-short-view performance gap. Specifically, in the first stage, we replace the commonly used dot-product with angular similarity scoring and leverage a modified softmax to counter prefix position bias. In the second stage, we fine-tune only bias and LayerNorm components, which are universal to standard sequential backbones, for further improvement. Both stages are guided by carefully designed learning objectives. Extensive experiments on two representative backbones across three public datasets demonstrate the effectiveness of our proposed framework.

推荐系统序列建模冷启动高效推理

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。