Saved in:
Bibliographic Details
Main Authors: Wang, Xuesi, Wang, Junjie, Wang, Ziliang, Bian, Weijie, Zhang, Guanxing
Format: Preprint
Published: 2026
Subjects:
Online Access:https://arxiv.org/abs/2606.01844
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866910280133378048
author Wang, Xuesi
Wang, Junjie
Wang, Ziliang
Bian, Weijie
Zhang, Guanxing
author_facet Wang, Xuesi
Wang, Junjie
Wang, Ziliang
Bian, Weijie
Zhang, Guanxing
contents Semantic IDs represent items as shared discrete token sequences and have become a practical tool for recommendation and retrieval. Yet it remains difficult to tell why a tokenizer fails: poor quality may come from codebook underutilization, unstable decision boundaries, or geometric distortion of the embedding space. This paper develops a quantitative framework for diagnosing these failures through expected codeword overlap and effective codebook capacity. The former measures expected codeword confusion under retrieval-time perturbation, while the latter converts that confusion into an effective number of usable, well-separated codes. The framework links semantic boundary confusion to both code usage imbalance and Euclidean geometric constraints. As a proof of concept, we present Decoupled Residual Quantization (DRQ), which separates continuous geometry reconstruction from discrete distribution matching. Experiments on a large-scale industrial dataset show that Semantic ID quality is multi-objective: symbolic robustness, reconstruction fidelity, and behavior-aware soft matching each stress different aspects of a tokenizer. These downstream observations are based on one proprietary industrial dataset, so they should be read as a case study rather than a universal benchmark claim.
format Preprint
id arxiv_https___arxiv_org_abs_2606_01844
institution arXiv
publishDate 2026
record_format arxiv
spellingShingle Decoupled Residual Quantization for Robust Semantic IDs in Recommendation
Wang, Xuesi
Wang, Junjie
Wang, Ziliang
Bian, Weijie
Zhang, Guanxing
Information Retrieval
Semantic IDs represent items as shared discrete token sequences and have become a practical tool for recommendation and retrieval. Yet it remains difficult to tell why a tokenizer fails: poor quality may come from codebook underutilization, unstable decision boundaries, or geometric distortion of the embedding space. This paper develops a quantitative framework for diagnosing these failures through expected codeword overlap and effective codebook capacity. The former measures expected codeword confusion under retrieval-time perturbation, while the latter converts that confusion into an effective number of usable, well-separated codes. The framework links semantic boundary confusion to both code usage imbalance and Euclidean geometric constraints. As a proof of concept, we present Decoupled Residual Quantization (DRQ), which separates continuous geometry reconstruction from discrete distribution matching. Experiments on a large-scale industrial dataset show that Semantic ID quality is multi-objective: symbolic robustness, reconstruction fidelity, and behavior-aware soft matching each stress different aspects of a tokenizer. These downstream observations are based on one proprietary industrial dataset, so they should be read as a case study rather than a universal benchmark claim.
title Decoupled Residual Quantization for Robust Semantic IDs in Recommendation
topic Information Retrieval
url https://arxiv.org/abs/2606.01844