Paper

Can Discrete Tokens Serve as Semantically Lossless Representations of Visual Signals?

A bit-budget-first discrete visual tokenizer that uses parallel codebooks on complementary full-feature views, rather than residual or channel-split quantization.

arXiv ↗Oct 27, 2026Code ↗

  • cv
  • multimodal
  • visual tokenization
  • vector quantization
  • ocr
Training pipeline and FVQ method diagram showing the core architecture
Training pipeline and FVQ method diagram showing the core architecture

What it is

Tests whether discrete visual tokens can be semantically lossless and introduces FVQ, a quantizer that scales bit budget without saturating, matching continuous vision features. Instead of treating quantization error as the limit, it scales semantic capacity via bit budget. FVQ replaces residual or split-channel codebooks with symmetric parallel codebooks over complementary full-feature views, avoiding high-budget saturation.

Key results

  • 65.3 avg on 8 benchmarks vs 64.6 for continuous QwenViT
  • 22.8% higher 9-metric average than UniAR
  • 59.2% higher 9-metric average than Emu3-Chat

Discrete visual tokens can match continuous visual representations when added bits remain semantically informative.

One useful ML email a week.

Worth your time, not all of your time.

We track new ML work across papers, code, and data, then keep only the pieces worth a closer look. Selected, not collected.

Papers.Data.Code

The Weekly ML Signal

Selected, not collected.

One useful ML email a week: the papers, repos and datasets worth your attention.

Worth your time, not all of your time.