Learning to Reflect and Correct: Towards Better Decoding Trajectories for Large-Scale Generative Recommendation

Fuente: arXiv
Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Xing, Haibo, Deng, Hao, Mu, Lingyu, Hu, Jinxin, Zhang, Yu, Zeng, Xiaoyi, Zhang, Jing
Format: Preprint
Veröffentlicht: 2026
Schlagworte:
Online-Zugang:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
_version_ 1866908855385980928
author Xing, Haibo
Deng, Hao
Mu, Lingyu
Hu, Jinxin
Zhang, Yu
Zeng, Xiaoyi
Zhang, Jing
author_facet Xing, Haibo
Deng, Hao
Mu, Lingyu
Hu, Jinxin
Zhang, Yu
Zeng, Xiaoyi
Zhang, Jing
contents Generative Recommendation (GR) has become a promising paradigm for large-scale recommendation systems. However, existing GR models typically perform single-pass decoding without explicit refinement, causing early deviations to accumulate and ultimately degrade recommendation quality. To tackle this problem, we propose GRC, which is, to our knowledge, the first structured reflection-correction framework for GR that extends standard decoding into a Generation-Reflection-Correction (GRC) process. Concretely, GRC introduces a supervised reflection-correction template that decomposes the decoding process into initial draft generation, multi-granular reflection, and reflection-guided correction, thereby enabling structured reflection and correction in the semantic token space. To further explore the enlarged refinement space introduced by the GRC process, we optimize the entire GRC trajectory with GRPO-based reinforcement learning, under a carefully designed reward function with token-level and trajectory-level signals. For efficient online serving, we propose an Entropy-Guided Reflection Scheduling (EGRS) strategy that dynamically allocates more correction budget to high-uncertainty decoding trajectories during beam search. Extensive experiments on real-world datasets show that GRC consistently outperforms six state-of-the-art baselines by up to 15.74%, and online A/B tests demonstrate its substantial practical value in large-scale industrial recommendation, delivering a 1.79% lift in advertising revenue with only modest latency overhead.
format Preprint
id arxiv_https___arxiv_org_abs_2602_23639
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Learning to Reflect and Correct: Towards Better Decoding Trajectories for Large-Scale Generative Recommendation
Xing, Haibo
Deng, Hao
Mu, Lingyu
Hu, Jinxin
Zhang, Yu
Zeng, Xiaoyi
Zhang, Jing
Information Retrieval
Generative Recommendation (GR) has become a promising paradigm for large-scale recommendation systems. However, existing GR models typically perform single-pass decoding without explicit refinement, causing early deviations to accumulate and ultimately degrade recommendation quality. To tackle this problem, we propose GRC, which is, to our knowledge, the first structured reflection-correction framework for GR that extends standard decoding into a Generation-Reflection-Correction (GRC) process. Concretely, GRC introduces a supervised reflection-correction template that decomposes the decoding process into initial draft generation, multi-granular reflection, and reflection-guided correction, thereby enabling structured reflection and correction in the semantic token space. To further explore the enlarged refinement space introduced by the GRC process, we optimize the entire GRC trajectory with GRPO-based reinforcement learning, under a carefully designed reward function with token-level and trajectory-level signals. For efficient online serving, we propose an Entropy-Guided Reflection Scheduling (EGRS) strategy that dynamically allocates more correction budget to high-uncertainty decoding trajectories during beam search. Extensive experiments on real-world datasets show that GRC consistently outperforms six state-of-the-art baselines by up to 15.74%, and online A/B tests demonstrate its substantial practical value in large-scale industrial recommendation, delivering a 1.79% lift in advertising revenue with only modest latency overhead.
title Learning to Reflect and Correct: Towards Better Decoding Trajectories for Large-Scale Generative Recommendation
topic Information Retrieval
url https://arxiv.org/abs/2602.23639