Prefix Alignment with Temporal History (PATH), which aggregates transition statistics from the training corpus over recent interactions with exponential decay to construct history-conditioned two-token prefix targets, is proposed, showing consistent improvements in recommendation performance and higher full-SID survival rates.
Abstract
Generative recommendation retrieves items by autoregressively generating semantic identifiers, but beam search may discard a target before its complete identifier is generated. Our preliminary analysis across three benchmarks shows that most missed targets are pruned within the first two decoding steps, highlighting the importance of early prefix retention. However, retaining a target's first-token branch alone is insufficient if its continuation is pruned at the next step: aligning only the first-token distribution improves first-token survival but yields little gain in complete-path retention. This observation motivates joint supervision of early branches and their continuations. We propose Prefix Alignment with Temporal History (PATH), which aggregates transition statistics from the training corpus over recent interactions with exponential decay to construct history-conditioned two-token prefix targets. PATH aligns the model's joint predictions with these targets through forward KL divergence, using a chain-rule decomposition that enables unbiased Monte Carlo estimation. At inference time, PATH reuses the transition statistics for pointwise mutual information (PMI) calibration, reranking completed candidates relative to global prefix frequency. Experiments on Beauty, Instruments, and Yelp demonstrate the effectiveness of PATH, showing consistent improvements in recommendation performance and higher full-SID survival rates.
CoSID is introduced, a concept-conditioned SID decoder that encodes the history once into a compact next-item concept and delegates the entire beam search to a lightweight KV-cached decoder.
Danil Gusak, A. Volodkevich, Evgeny Frolov· Proceedings of the 20th ACM...· 1 citation
EchoRec is proposed, which empowers MTP with cycle-consistent holistic preference alignment across multi-horizon for generative recommendation and demonstrates the superiority of the EchoRec, together with its naturally acquired multi-item generation ability.
Haokai Ma, Ao-Qi Hu, Yueao Xing et al.· 0 citations
Difficulty-Aware Semantic-ID Optimization (DASO), a tree-aware post-training method that addresses failure mode as an online rollout-allocation problem and improves over MiniOneRec-style GRPO on 11 of 12 metrics and achieves the best result on 9 of 12 metrics.
JEV models make multimodal decisions by directly scoring candidates. Although the common context is encoded once, candidate evaluation can still repeat matching token histories, duplicate inference states, and execute the full backbone. In this paper, we study these sources of redundancy and present FastJEV for compact...
ChronicleRec is a pre-train-and-transfer framework that compresses an ultra-long behavior sequence once into a chronologically ordered set of Chronicle Tokens, which can be cached per user, decoupling ultra-long sequence modeling from online candidate scoring.
Chengkai Huang, Yu-Bin Sheng, Liang Guo et al.· 0 citations
Semantic ID (SID) generative recommendation predicts the next item by generating a short tuple of discrete tokens. Recent masked-diffusion methods improve this process through bidirectional context and flexible decoding, yet recommendation ultimately requires selecting among complete catalog items. At each denoising st...
Tuan-Binh Tran, T. Nguyen, Quoc Viet Hung Nguyen et al.· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.