Can Discrete Tokens Serve as Semantically Lossless Representations of Visual Signals?
Summary
该论文挑战了离散视觉令牌必然存在语义损失的假设,提出因子化向量量化(Factorized Vector Quantization),在多模态理解上达到与连续视觉表示相当的水平,并在离散表示模型中取得最先进性能。
View Cached Full Text
Cached at: 10/28/26, 09:25 AM
Paper page - Can Discrete Tokens Serve as Semantically Lossless Representations of Visual Signals?
Source: https://huggingface.co/papers/2610.37662
Abstract
Factorized Vector Quantization improves discrete visual token quality by using parallel codebooks on complementary feature views, enabling discrete representations to match continuous ones in multimodal understanding.
Discrete visual tokensrepresent vision in a discrete form analogous to language, offering a native interface formultimodal modelingunder a sharednext-token predictionobjective. However,quantization erroris widely assumed to cause unavoidable semantic loss, fundamentally limiting the semantic fidelity ofdiscrete visual tokensand positioningcontinuous visual representationsas an intrinsic upper bound. Using multimodal understanding as a proxy for semantic fidelity, we revisit this assumption and findquantization errorunreliable, as discrete representations with substantially larger errors can achieve better understanding. Instead, the effective bit budget of discrete indices emerges as a key determinant of downstream performance. However, existing quantizers eventually saturate as additionalcodebookscontribute progressively less semantic information. As one approach to alleviating this saturation, we introduceFactorized Vector Quantization, which quantizes complementary, fixed-dimensional views of the visual feature with symmetric parallelcodebooks. It continues to improve at larger bit budgets, ultimately matchingcontinuous visual representationsin multimodal understanding. Trained on industrial-scale multimodal data, our model achieves state-of-the-art performance among discrete-representation models, outperforming UniAR and Emu3-Chat by 22.8% and 59.2%, respectively, on a nine-metric average. To our knowledge, it is also the first discrete-representation model competitive with strong continuous-representation models such as Qwen3-VL, including on fine-grained OCR tasks. We further identify the key principles and a practical recipe enabling this competitiveness. These results and insights support the potential of discrete visual representations to underpin large-scale native multimodal foundation models. Code and models are available at https://github.com/hustvl/FVQ
View arXiv pageView PDFProject pageGitHub8Add to collection
Get this paper in your agent:
hf papers read 2610\.37662
Don’t have the latest CLI?curl \-LsSf https://hf\.co/cli/install\.sh \| bash
Models citing this paper0
No model linking this paper
Cite arxiv.org/abs/2610.37662 in a model README.md to link it from this page.
Datasets citing this paper0
No dataset linking this paper
Cite arxiv.org/abs/2610.37662 in a dataset README.md to link it from this page.
Spaces citing this paper0
No Space linking this paper
Cite arxiv.org/abs/2610.37662 in a Space README.md to link it from this page.
Collections including this paper0
No Collection including this paper
Add this paper to acollectionto link it from this page.
Similar Articles
Vision Token Pruning via Query-Vision Interaction Decomposition
论文提出 QViD,一种免训练的查询感知视觉token剪枝方法,通过发现查询-视觉交互矩阵的低秩结构并分解出主导潜在交互模式,在图像与视频理解基准上以相同token预算持续提升性能,尤其在高压缩率下增益显著。
A Unified Rate-Distortion Perspective on Vector, Product, and Scalar Quantization
This paper proposes a unified rate-distortion perspective on discrete visual tokenization, resolving key questions about quantization objectives and comparisons, and shows that vector quantization achieves the lowest distortion under controlled conditions.
Just MLPs: Efficient Visual State Reconstruction for Multimodal Language Models
The paper proposes δ-Vision, a method to reduce computational overhead in multimodal language models by using lightweight low-rank adapters to reconstruct visual states efficiently without discarding visual tokens.
Beyond Selection: Token Parameterization for Extreme Visual Token Compression
The paper introduces Braco, a lightweight token parameterization method for visual token compression in vision-language models, achieving significant efficiency gains and accuracy under extreme compression budgets.
V-CoLA: Vision Token Compression with Linear Attention
V-CoLA 提出一种面向线性注意力混合架构的免训练视觉 token 压缩框架,通过独特性感知的重要性准则与自适应 token 合并策略,在仅保留 50% 视觉 token 时达到 99.5% 原始性能,并实现 1.86x 至 6.15x 的预填充加速。