Beyond Selection: Token Parameterization for Extreme Visual Token Compression
Rui Zhong, Yu Li, Zheyu Yan, Cheng Zhuo
Zhejiang University
Published September 28, 2026 · on the feed September 30, 2026 · ▲ 7 · arXiv 2609.35232
The abstract
Visual-token compression is effective for improving the efficiency of vision-language models, but under extreme compression budgets, token pruning can break visual grounding while learned resamplers increase parameter count, attention cost, and training complexity. We revisit compression through a token parameterization lens, separating (i) basis transformation and structured truncation (retained subspace/compressibility) from (ii) coordinate organization (optimization and cross-modal alignment). This view yields two coupled objectives, compressibility and learnability, which we formalize as unified functionals. Guided by these objectives, we design Braco, a lightweight four-step coder that combines transform-basis truncation, input-independent basis-coordinate embeddings, budget-dependent orthogonal re-parameterization, and learned spatial residual tokens from lightweight pooling. Experiments show that Braco forms the favorable empirical accuracy-efficiency frontier under 23times--64times compression and remains competitive at 144times, reaching 95.2% accuracy while reducing prefill FLOPs by 84.2%--86.7% relative to the uncompressed upper bound. Against prior methods, Braco matches or improves accuracy while achieving up to approximately 36% end-to-end speedup and using 16.6times/78.8times lower compressor latency/FLOPs.
The Brief
2:16A short podcast summary of the paper. Written and voiced by AI.
Transcript
Beyond Selection. Token Parameterization for Extreme Visual Token Compression. By Rui Zhong and three others, from Zhejiang University. Published on the twenty-eighth of September. Its code repository is public and real: seventeen source files.
Compressing visual tokens makes vision-language models more efficient, but under extreme compression budgets both standard routes run into trouble. Squeezing an image down to a handful of tokens forces a choice about what survives. Pruning tokens can break visual grounding. Learned resamplers, the other route, increase parameter count, attention cost and training complexity.
The authors step back and look at compression as a question of how tokens are parameterized. They separate two parts. One is a change of basis followed by structured truncation, which decides what subspace is kept and how compressible the input is. The other is how the coordinates are organized, which governs optimization and alignment across modalities. That split yields two coupled objectives, compressibility and learnability, formalized as unified functionals. Compressibility asks how much of the image survives the cut. Learnability asks whether what survives is arranged so that training and alignment with text go smoothly.
Braco is the coder designed under those objectives. It is lightweight and works in four steps: truncation in a transform basis, basis-coordinate embeddings that do not depend on the input, an orthogonal re-parameterization that depends on the budget, and learned spatial residual tokens produced by lightweight pooling.
Braco sets the favourable accuracy-efficiency frontier between twenty-three times and sixty-four times compression, and stays competitive at one hundred forty-four times. There it reaches ninety-five point two percent accuracy while cutting prefill compute by roughly eighty-four to eighty-seven percent against the uncompressed upper bound. Against prior methods it matches or improves accuracy, with up to about thirty-six percent end-to-end speedup. The compressor itself is far cheaper than those alternatives, with latency lower by sixteen point six times and compute lower by seventy-eight point eight times.
The title says beyond selection, and that is the shift. Instead of choosing which tokens survive, Braco changes the basis they are written in, truncates there, and then attends to how the remaining coordinates are organized so the model can learn from them.
Paper Quest · 7 chapters · about 39 min
Play this paper
Learn it by doing: make the calls the authors made, guess the result before you see it, and defend it in a viva graded on your own words. Chapter 1 is right here.
Chapter 1 🧩 · The problem
Too many image tokens, too small a budget. Every quest starts with a squeeze like this one.
You run a vision-language model on a phone. Every image becomes hundreds of tokens, and the language model's cost grows with each one. Your budget allows only a few dozen tokens per image, sometimes fewer.
The road ahead
- 1 · The problem ~6 min A phone can afford only a few dozen image tokens, and both usual ways of shrinking an image break or cost too much at that budget.
- 2 · What came before ~3 min
- 3 · The key idea ~8 min Rewrite the image in a transform basis and keep a fixed low-frequency block, arrange those coordinates for easy learning, then restore position and local detail.
- 4 · Choose your own research ~3 min
- 5 · Build the method ~8 min Braco runs four steps: truncate in a transform basis, add position embeddings, reorganise coordinates by budget, and append pooled spatial residual tokens.
- 6 · The experiment ~6 min You’ll guess: Against QueCC, the closest prior compressor, how much lower was Braco's compressor latency at 16 tokens?
- 7 · The viva ~5 min Three questions from the examiners, answered in your own words. Win it for the paper’s trophy.
Free, with Google or an email address. Your stars and progress are kept.