Hugging Face Trending Papers

PRQ-KMeans: Projection Residual Quantization for Semantic ID Tokenization

arXiv AI
Sep 30

FineSID: Scalable and Efficient Semantic Identifier Learning for Generative Recommendation

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.

By Song-Li Wu, Weinan Gan, Zhaocheng Du, Xianquan Wang, Jingyi Wang
arXiv Machine Learning
Aug 24

From a Static Multi-Level Small Semantic Codebook to a Dynamic Single-Level Large Semantic Codebook for Generative Recommendation

The paper proposes replacing a static multi‑level small semantic codebook with a dynamic single‑level large semantic codebook for generative recommendation. It introduces an exposure‑aware update mechanism and an offline evaluation framework, achieving significant improvements in recall, NDCG, decoding efficiency, and online consumption metrics on public datasets and production traffic.

By Tianlu Xie, Xin Ku, Mingjie Sun, Yunhao Sha, Lixiang Wang, Peng Wang, Yiyu Wang, Wenjin Wu, Zhaojie Liu, Peng Jiang, Wenwu Ou
arXiv AI
Jun 26

The Best of the Two Worlds: Harmonizing Semantic and Hash IDs for Sequential Recommendation

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.

By Ziwei Liu, Yejing Wang, Wanyu Wang, Wang Zejian, Qidong Liu, Zijian Zhang, Chong Chen, Wei Huang, Xiangyu Zhao
arXiv AI
Sep 10

Exploring Bottom-Up Clustering for Creating 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.

By Leah Woldemariam, Sudhanshu Garg, Taha Belkhouja, Charles Kim-Yip, Ali Sahami
arXiv AI
Aug 26

Tlow: Flow-based Item Tokenizer for Recommendation

The paper introduces Tlow, a flow-based item tokenizer that transforms raw semantic embeddings into a latent space following a standard normal distribution, enabling independent tokenization and simplifying distributional complexity. Tlow incorporates codebook guidance to align token embeddings with the codebook space, producing semantically clear token IDs. Experiments on four public datasets and an online multi‑modal retrieval task on WeChat show that Tlow improves recommendation performance and increases user click‑through rates by over 10%.

By Nian Li, Chonggang Song, Jingtao Ding, Lingling Yi, Yong Li, Qingmin Liao
arXiv AI
1d ago

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.

By Yu Sun, Renkai Xiang, Zuodong Xiang, Junwei Zhou, Yike Zhang, Jianxin Zhang, Zhihao Zhu, Xiaoyu Cao, Hailu Xu