arXiv AI

Beyond Semantic IDs: Finite-Beam Reachability and Continuous-Query Generation in Generative Recommendation

The paper introduces two continuous-query paradigms—CQG‑Single and CQG‑AR—to replace the traditional finite-beam, discrete Semantic ID (SID) decoding used in generative recommendation systems. By removing the SID vocabulary and beam expansion, these methods allow every encoded item to be directly scored via dense or approximate-nearest-neighbor retrieval, thereby eliminating the reachability constraints of finite-beam decoding. Experiments show that CQG‑Single outperforms a TIGER-style baseline across all runs while using fewer parameters, and CQG‑AR performs comparably or better on several datasets, suggesting that decoupling output representation, autoregressive modeling, and retrieval budget can improve generative recommendation evaluation.

arXiv AI
Sep 1

Preference Shapes Relevance: Cross-component Hierarchical Semantic Alignment for Personalized Generative Retrieval

The paper introduces CHAP, a personalized generative retrieval framework that aligns query semantics with item representations through a hierarchical semantic alignment module and models user behavior using both discrete Semantic IDs and continuous representations. It also proposes a Residual Cascading Generation mechanism to reduce inference latency by limiting the Transformer decoder to a single pass. Experiments on multiple datasets and online A/B tests show that CHAP outperforms existing methods, demonstrating its practical value.

By Gaoming Zhang, Angqing Jiang, Jianchun Song, Kena Qi, Dayao Chen, Wei Lin, Defu Lian
Hugging Face Trending Papers
Sep 24

From Interests to Semantic IDs: Retrieval-Grounded Credit Assignment for Generative Recommendation

The paper introduces a retrieval‑grounded credit‑assignment method for generative recommenders that use Semantic IDs (SIDs). By structuring each autoregressive trace into a history summary, a set of interest hypotheses, and a final SID, a frozen retriever verifies each hypothesis as a catalog query. Rewards are assigned at the hypothesis level when any query retrieves the target within the top‑K, allowing distinct updates for rollouts that share the same SID reward and improving SID recommendation performance on Amazon Reviews datasets.

arXiv AI
Sep 25

From Interests to Semantic IDs: Retrieval-Grounded Credit Assignment for Generative Recommendation

The paper proposes a retrieval‑grounded credit‑assignment method for generative recommenders that use Semantic IDs (SIDs). By structuring each generated trace into a history summary, a set of interest hypotheses, and a final SID, and then verifying each hypothesis with a frozen retriever, the method assigns reward at the hypothesis level rather than only at the final SID. Experiments on Amazon Reviews datasets show consistent improvements in SID recommendation, and an oracle analysis on Video Games data demonstrates that selecting target‑relevant queries among generated interests boosts recall and ranking.

By Mengdan Zhu, Yufan Zhao, Yao Zhao, Sophie Di, Tao Di, Yulan Yan, Sridhar Iyer, Liang Zhao
arXiv AI
Jun 8

Understanding Generative Recommendation with Semantic IDs from a Model-scaling View

arXiv:2509. 25522v3 Announce Type: replace Abstract: Recent advancements in generative models have allowed the emergence of a promising paradigm for recommender systems (RS), known as Generative Recommendation (GR), which tries to unify rich item semantics and collaborative filtering signals.

By Jingzhe Liu, Liam Collins, Jiliang Tang, Tong Zhao, Neil Shah, Clark Mingxuan Ju
arXiv AI
Sep 4

WIDE: Wildcard Inference with Dynamic Expansion for Cross-Modal Generative Retrieval

WIDE: Wildcard Inference with Dynamic Expansion for Cross-Modal Generative Retrieval proposes a new approach to address information asymmetry in cross-modal retrieval. The method introduces Adaptive Entropy Thresholding to calibrate uncertainty, Asymmetry-aware Wildcard Decoding to emit wildcards instead of forced identifiers, and Blind-Spot Re-ranking to evaluate expanded candidates. Experiments on the M-BEIR benchmark show that WIDE outperforms existing generative retrieval methods by reducing forced hallucination while keeping index structures compact.

By Teng Guo, Xin Wang, Jiayou Xu, Keying Zhou, Jifeng Shen, Haoxin Ruan
Hugging Face Trending Papers
Sep 3

WIDE: Wildcard Inference with Dynamic Expansion for Cross-Modal Generative Retrieval

The paper introduces WIDE, a method for cross‑modal generative retrieval that tackles information asymmetry between text queries and visual candidates. WIDE uses Adaptive Entropy Thresholding to set uncertainty limits, Asymmetry‑aware Wildcard Decoding to emit wildcards where the model lacks fine‑grained detail, and Blind‑Spot Re‑ranking to score an expanded candidate set with both discrete confidence and continuous similarity. Experiments on the M‑BEIR benchmark show that WIDE reduces forced hallucination and outperforms existing generative retrieval approaches while keeping index structures compact.