解决生成推荐中训练与推理不一致的问题,提升推荐准确性。
APAO: Bridging the Training-Inference Gap in Generative Recommendation via Adaptive Prefix-Aware Optimization
- 引入前缀级优化损失,让训练更贴近推理时的束搜索过程。
- 动态关注最易出错的前缀,显著提升正确物品保留率。
- 适用于各类生成式推荐模型,尤其适合长序列推荐场景。
生成式推荐近年成为序列推荐的有力范式,将任务建模为自回归生成过程,基于用户交互历史预测下一个物品的标记。现有模型通常采用交叉熵等标记级似然目标进行训练,但推理时使用束搜索生成候选列表。这导致训练与推理间的根本性不一致:训练假设真值标记始终可用,而束搜索会在推理中剪枝低概率分支,使得正确物品因前缀得分低而被过早丢弃。为此,本文提出自适应前缀感知优化(APAO)框架,引入前缀级优化损失以更好对齐训练目标与推理设置。此外,设计自适应最差前缀优化策略,动态聚焦训练中最具脆弱性的前缀,从而增强模型在束搜索约束下保留正确候选的能力。理论分析证明了框架的有效性与高效性。大量实验表明,APAO能持续缓解训练-推理不一致问题,并在多种生成式推荐基线模型上提升性能。源代码已公开于 https://github.com/yuyq18/APAO。
原文摘要 · Abstract (English)
Generative recommendation has recently emerged as a promising paradigm for sequential recommendation. It formulates the task as an autoregressive generation process, predicting tokens of the next item conditioned on user interaction histories. Existing generative recommendation models are typically trained with token-level likelihood objectives such as cross-entropy loss, while employing beam search during inference to generate ranked candidates. However, this leads to a fundamental training-inference inconsistency: standard training assumes ground-truth tokens are always available, while beam search prunes low-probability branches during inference, causing the correct item to be prematurely discarded when its prefixes receive low scores. To address this issue, we propose the Adaptive Prefix-Aware Optimization (APAO) framework, which introduces prefix-level optimization losses to better align the training objective with the inference setting. Furthermore, we design an adaptive worst-prefix optimization strategy that dynamically focuses on the most vulnerable prefixes during training, thereby enhancing the model's ability to retain correct candidates under beam search constraints. We provide theoretical analyses to demonstrate the effectiveness and efficiency of our framework. Extensive experiments show that APAO consistently alleviates the training-inference inconsistency and improves performance across generative recommendation backbones. The source code is publicly available at https://github.com/yuyq18/APAO.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。