The paper introduces Graph-Informed Semantic IDs (GrIS), a framework that reframes Semantic ID construction as a recursive clustering problem on a graph combining semantic content and collaborative signals. GrIS generalises previous methods like RQ-VAE and RQ-KMeans by allowing explicit graph construction and hierarchical partitioning, and presents two implementations: RecDMoN and RQ-GAE. Experiments on real-world datasets show that GrIS outperforms collaborative-filtering aware state‑of‑the‑art models, achieving up to a 52% increase in Hit@10.
arXiv:2607. 25216v1 Announce Type: cross Abstract: Semantic ID-based generative recommendation tokenizes each item into a sequence of discrete semantic IDs and predicts the next item by generating semantic IDs.
The paper proposes a new algorithm for generating Semantic IDs that are both unique and preserve the structure of the original embedding space. By employing bottom‑up clustering, the method maintains local structure, leading to higher clustering quality. This improved structure enhances the utility of the Semantic IDs for downstream generative retrieval tasks.
FineSID introduces a new quantization framework for semantic identifier learning in generative recommendation systems. By replacing the traditional Top‑1 hard assignment with a soft, differentiable approach, it distributes gradient updates across all codewords, leading to balanced codebook optimization and reduced identifier collisions. Experiments on public benchmarks show that FineSID improves codebook utilization and recommendation accuracy without relying on complex initialization strategies.
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.
Refine-POI introduces a reinforcement fine-tuned framework for next point-of-interest recommendation that tackles two key issues: topology-blind indexing of semantic IDs and the limitation of supervised fine-tuning to top‑1 predictions. It uses a hierarchical self‑organizing map to generate topology‑aware semantic IDs and a policy‑gradient approach to produce top‑k recommendation lists. Experiments on three real‑world datasets show that Refine‑POI outperforms state‑of‑the‑art baselines, combining LLM reasoning with accurate, explainable recommendations.
arXiv:2607. 25209v1 Announce Type: cross Abstract: Generative recommendation commonly represents items using fixed-length semantic identifiers (SIDs) constructed through clustering and quantization.
arXiv:2609.22227v1 Announce Type: cross Abstract: Generative retrieval represents each item by a short Semantic ID and casts recommendation as autoregressive generation of that sequence. Because the...
arXiv:2607. 24995v1 Announce Type: new Abstract: Semantic IDs (SIDs) are now a central component of generative recommendation.
arXiv:2608. 07816v1 Announce Type: cross Abstract: Recent advances in generative recommendation (GR) leverage large language models (LLMs) as recommender backbones, enabling LLMs to directly generate recommendations conditioned on item-interaction histories.
arXiv:2512. 10388v3 Announce Type: replace-cross Abstract: Conventional Sequential Recommender Systems (SRS) typically assign unique hash IDs (HID) to construct item embeddings, which mainly capture collaborative signals from historical user-item interactions.
arXiv:2607. 20477v1 Announce Type: new Abstract: {\em Text-Attributed Graphs} (TAGs) have emerged as an expressive data model for integrating graph topology with rich textual semantics.
arXiv:2603. 23183v2 Announce Type: replace-cross Abstract: Recent advances in generative recommendation have leveraged pretrained LLMs by formulating sequential recommendation as autoregressive generation over a unified token space comprising language tokens and itemic identifiers, where each item is represented by a compact sequence of discrete tokens, namely Semantic IDs (SIDs).