arXiv:2512.14036cs.IR2025-12被引 1

让推荐系统像人一样动态思考,复杂行为多想几步,简单行为快速决策。

DTRec: Learning Dynamic Reasoning Trajectories for Sequential Recommendation

  • 引入分层监督与自适应停止机制,让推理方向和深度可变。
  • 在三个真实数据集上提升性能最高达24.5%,计算成本降低41.6%。
  • 适合需要高精度且关注效率的推荐系统研究与应用。

受大模型启发,增强推理的序列推荐通过多步思考捕捉用户偏好,但现有方法受限于静态推理轨迹。其两大缺陷为:(1)推理方向固定,使用扁平监督信号,与人类分层思维不匹配;(2)推理深度固定,对所有用户采用相同计算量,造成资源浪费。为此,我们提出DTRec框架,实现推理方向与深度的动态调整。通过分层过程监督(HPS)提供由粗到细的引导信号,模拟人类认知渐进优化过程;设计自适应推理终止(ARH)机制,综合监控三项指标动态决定推理步数。在三个真实数据集上的实验表明,该方法相较强基线最高提升24.5%性能,同时计算开销减少41.6%。

原文摘要 · Abstract (English)

Inspired by advances in LLMs, reasoning-enhanced sequential recommendation performs multi-step deliberation before making final predictions, unlocking greater potential for capturing user preferences. However, current methods are constrained by static reasoning trajectories that are ill-suited for the diverse complexity of user behaviors. They suffer from two key limitations: (1) a static reasoning direction, which uses flat supervision signals misaligned with human-like hierarchical reasoning, and (2) a fixed reasoning depth, which inefficiently applies the same computational effort to all users, regardless of pattern complexity. These rigidity lead to suboptimal performance and significant computational waste. To overcome these challenges, we propose DTRec, a novel and effective framework that explores the Dynamic reasoning Trajectory for Sequential Recommendation along both direction and depth. To guide the direction, we develop Hierarchical Process Supervision (HPS), which provides coarse-to-fine supervisory signals to emulate the natural, progressive refinement of human cognitive processes. To optimize the depth, we introduce the Adaptive Reasoning Halting (ARH) mechanism that dynamically adjusts the number of reasoning steps by jointly monitoring three indicators. Extensive experiments on three real-world datasets demonstrate the superiority of our approach, achieving up to a 24.5% performance improvement over strong baselines while simultaneously reducing computational cost by up to 41.6%.

序列推荐动态推理大模型效率优化

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