提出Fave框架,实现推荐系统一次生成,速度提升十倍。
FAVE: Flow-based Average Velocity Establishment for Sequential Recommendation
- 用语义锚点作为起点,直接学习从历史到目标的平滑轨迹。
- 在三个数据集上达到顶尖性能,推理速度提升近10倍。
- 适合对响应速度要求高的实时推荐场景。
生成式推荐已成为捕捉用户意图动态演化的关键范式。尽管基于流的方法提升了扩散模型效率,但其仍受制于“噪声到数据”范式,存在先验不匹配(生成从无信息噪声开始,需长时间恢复)和线性冗余(迭代求解浪费计算建模确定性偏好转移)两大瓶颈。为此,我们提出基于流的平均速度建立框架(Fave),实现一步生成推荐。Fave采用渐进式两阶段训练:第一阶段通过双端语义对齐建立稳定偏好空间,在用户历史与目标物品两端施加约束,防止表征坍塌;第二阶段引入语义锚定先验,以用户交互历史的掩码嵌入初始化流,提供信息丰富的起点,并学习全局平均速度,将多步轨迹压缩为单个位移向量,通过基于JVP的一致性约束确保轨迹直线性,实现一步生成。在三个基准数据集上的大量实验表明,Fave不仅达到当前最优推荐性能,且推理效率提升一个数量级,适用于低延迟敏感场景。
原文摘要 · Abstract (English)
Generative recommendation has emerged as a transformative paradigm for capturing the dynamic evolution of user intents in sequential recommendation. While flow-based methods improve the efficiency of diffusion models, they remain hindered by the ``Noise-to-Data'' paradigm, which introduces two critical inefficiencies: prior mismatch, where generation starts from uninformative noise, forcing a lengthy recovery trajectory; and linear redundancy, where iterative solvers waste computation on modeling deterministic preference transitions. To address these limitations, we propose a Flow-based Average Velocity Establishment (Fave) framework for one-step generation recommendation that learns a direct trajectory from an informative prior to the target distribution. Fave is structured via a progressive two-stage training strategy. In Stage 1, we establish a stable preference space through dual-end semantic alignment, applying constraints at both the source (user history) and target (next item) to prevent representation collapse. In Stage 2, we directly resolve the efficiency bottlenecks by introducing a semantic anchor prior, which initializes the flow with a masked embedding from the user's interaction history, providing an informative starting point. Then we learn a global average velocity, consolidating the multi-step trajectory into a single displacement vector, and enforce trajectory straightness via a JVP-based consistency constraint to ensure one-step generation. Extensive experiments on three benchmarks demonstrate that Fave not only achieves state-of-the-art recommendation performance but also delivers an order-of-magnitude improvement in inference efficiency, making it practical for latency-sensitive scenarios.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。