Skip to content

TAAL: Mitigating Early Beam Pruning in Generative Recommendation via Temporal Autoregressive Alignment

Aug 2026 · 0 citations · 29 references
Computer Science

TL;DR

Temporal Autoregressive Alignment (TAAL) is proposed, which improves NDCG@10 over the standard baseline by 39.5%, and aligns the early-prefix distribution with a forward KL objective during training and during inference, it calibrates candidate scores with pointwise mutual information (PMI) to reduce the influence of globally frequent prefixes.

Abstract

Generative recommendation encodes items as hierarchical semantic identifiers (SIDs) and retrieves the next item through autoregressive decoding. Standard next-token prediction, however, does not explicitly cover the multimodal transitions present in interaction sequences, leaving the ground-truth SID vulnerable to irreversible pruning at early beam-search branches. Across three public benchmarks, we find that 91.9\%--96.6\% of retrieval failures occur within the first two decoding steps. We therefore propose Temporal Autoregressive Alignment (TAAL). During training, TAAL constructs a joint $(c_1,c_2)$ soft target from historical transitions and aligns the early-prefix distribution with a forward KL objective. During inference, it calibrates candidate scores with pointwise mutual information (PMI) to reduce the influence of globally frequent prefixes. On Amazon Beauty, Instruments, and Yelp, TAAL improves NDCG@10 over the standard baseline by 39.5\%, 6.7\%, and 28.6\%, respectively, while increasing full-SID survival by 3.9\%--16.6\%. Beam-width analysis further shows that the relative survival gain grows as the beam narrows, reaching 39.4\% at $B=5$.

View source

Similar papers

Book Open access Sep 2026

CoSID: Concept-Conditioned Semantic-ID Decoding for Efficient Generative Recommendation

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 · 1 citation
Preprint Aug 2026

EchoRec: Multi-Item Prediction-Empowered Generative Recommendation via Cycle-Consistent Preference Alignment

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
Preprint Aug 2026

Difficulty-Aware Semantic-ID Optimization for Generative Recommendation

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.

Xin Yu, Stephen Li, S. Aghaei et al. · 1 citation
Preprint Aug 2026

Learning from Unreachable Rewards: Hint-Conditioned Reinforcement Learning for Generative Recommendation

This work proposes Hint-Conditioned Generative Recommendation (HCGRec), a semantic-ID generative recommendation framework that recovers learning signal for such hard training instances and introduces hint-aware credit decomposition, using supervised learning to preserve item-semantic and prefix-structure alignment for...

Kang-Ning Zhang, Hao Fang, Xukun Luo et al. · 0 citations
Preprint Sep 2026

ChronicleRec: Pre-training Temporally Anchored Tokens for Lifelong User Modeling

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
#machine learning Preprint Sep 2026

EPIC: Explicit Posterior Item Conditioning for Semantic ID Diffusion Recommendation

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

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.