arXiv:2602.08678cs.IR2026-02

新方法让推荐系统高效更新,省内存省时间。

SA-CAISR: Stage-Adaptive and Conflict-Aware Incremental Sequential Recommendation

  • 不存缓存,用旧模型和新数据直接更新。
  • 平均提升召回率2.0%,内存减少97.5%。
  • 适合需要快速迭代的实时推荐场景。

序列推荐(SR)旨在通过学习用户的历史交互序列预测其下一步行为。在实际应用中,模型需定期更新以适应新交互和不断变化的用户偏好。尽管增量学习方法可实现更新,但仍面临挑战:基于重放的方法消耗大量内存与计算资源,基于正则化的方法常难以清除过时或冲突的知识。为此,本文提出无需缓存的阶段自适应、冲突感知增量序列推荐框架SA-CAISR。该方法引入基于Fisher信息的知识筛选机制,动态评估旧模型与新数据之间的参数级冲突,识别并选择性移除过时知识,同时保留兼容的历史模式。这种稳定性与适应性的动态平衡使方法在增量序列推荐中达到当前最优表现:在多个数据集上平均提升Recall@20达2.0%,相比最佳基线内存降低97.5%,训练时间减少46.9%。该效率使真实系统能以极低算力开销快速更新用户画像,确保推荐结果更及时准确。

原文摘要 · Abstract (English)

Sequential recommendation (SR) aims to predict a user's next action by learning from their historical interaction sequences. In real-world applications, these models require periodic updates to adapt to new interactions and evolving user preferences. While incremental learning methods facilitate these updates, they face significant challenges. Replay-based approaches incur high memory and computational costs, and regularization-based methods often struggle to discard outdated or conflicting knowledge. To overcome these challenges, we propose SA-CAISR, a Stage-Adaptive and Conflict-Aware Incremental Sequential Recommendation framework. As a buffer-free framework, SA-CAISR operates using only the old model and new data, directly addressing the high costs of replay-based techniques. SA-CAISR introduces a novel Fisher-weighted knowledge-screening mechanism that dynamically identifies outdated knowledge by estimating parameter-level conflicts between the old model and new data, selectively removing obsolete knowledge while preserving compatible historical patterns. This dynamic balance between stability and adaptability allows our method to achieve state-of-the-art performance in incremental SR. Specifically, SA-CAISR improves Recall@20 by 2.0% on average across datasets, while reducing memory usage by 97.5% and training time by 46.9% compared to the best baseline. This efficiency allows real-world systems to rapidly update user profiles with minimal computational overhead, ensuring more timely and accurate recommendations.

序列推荐增量学习高效更新

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