Just MLPs: Efficient Visual State Reconstruction for Multimodal Language Models
Jingdi lei, Junxian Li, Di Zhang, Zhanqiu Zhang, Yiwen Guo, Soujanya Poria
Nanyang Technological University · Shanghai Jiao Tong University · Fudan University · LIGHTSPEED · Independent Researcher
Published September 28, 2026 · on the feed September 29, 2026 · ▲ 30 · arXiv 2609.34972
The abstract
Long visual token sequences often account for a substantial fraction of the computational overhead in multimodal large language models~(MLLMs). Existing approaches reduce this cost by pruning redundant visual tokens, but permanently discard visual evidence that may become useful in subsequent layers. We instead ask whether all visual tokens can be preserved while reducing the cost of repeatedly evolving the representations through the Transformer. To answer this question, we perform low-rank interventions on visual-to-text information flow. We find that, after visual-to-text attention is blocked, restoring only a few directions recovers most of the lost accuracy, suggesting the relevant visual influence is concentrated in a low-dimensional subspace. We further observe strong predictability in layer-specific visual states: lightweight MLPs approximate them with high cosine similarity and low reconstruction error. Motivated by these findings, we propose δ-Vision, which replaces repeated Transformer evolution of visual tokens with lightweight low-rank adapters that construct layer-wise visual memories while preserving all visual tokens for text retrieval. Across image and video benchmarks, δ-Vision achieves higher accuracy than visual token pruning baselines at comparable or lower computation, while delivering competitive inference efficiency without discarding visual tokens.
The Brief
2:32A short podcast summary of the paper. Written and voiced by AI.
Transcript
Just MLPs. Efficient Visual State Reconstruction for Multimodal Language Models. By Jingdi lei and five others, from Nanyang Technological University, Shanghai Jiao Tong University, and three other institutions. Published on the twenty-eighth of September. Its code repository is worked out: about two hundred source files, with a readme.
Long sequences of visual tokens often account for a large share of the computational overhead in multimodal large language models. The usual remedy prunes visual tokens judged redundant, but pruning throws away visual evidence permanently, evidence that may turn useful in later layers. The authors ask a different question: can every visual token be kept, while cutting the cost of repeatedly evolving those tokens through the Transformer?
Two observations shape the answer. The first comes from low-rank interventions on the flow of information from visual tokens to text. After visual-to-text attention is blocked, restoring only a few directions recovers most of the lost accuracy, which suggests the visual influence that matters sits in a low-dimensional subspace. The second is that the visual states at each layer are strongly predictable. Lightweight MLPs approximate them with high cosine similarity and low reconstruction error. Put together, the two observations say something useful. What text needs from the image passes through a narrow channel, and what the image tokens become at each layer can be guessed cheaply. Running the full Transformer over them, layer after layer, may be doing more work than the answer requires.
The method, called delta-Vision, replaces the repeated Transformer evolution of visual tokens with lightweight low-rank adapters. Those adapters construct a visual memory for each layer, while all the visual tokens are preserved so the text can still retrieve from them. Instead of pushing every visual token through every layer at full cost, the model rebuilds what each layer needs from something much smaller.
Across image and video benchmarks, delta-Vision reaches higher accuracy than visual token pruning baselines at comparable or lower computation. It also delivers competitive inference efficiency without discarding any visual tokens. The abstract does not give specific figures. The comparison it does describe is the one the design invites. Pruning baselines save compute by dropping evidence, and delta-Vision is claimed to match or undercut that compute while keeping the evidence and scoring higher.
Pruning attacks the cost of visual tokens by keeping fewer of them. This work keeps all of them and questions a different habit, the assumption that each layer has to recompute them the expensive way. The title states the alternative plainly: just MLPs.
Paper Quest · 7 chapters · about 41 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
Images are worth many tokens, and every one costs compute at every layer. That is the wall.
You run a multimodal language model on high-resolution images and videos. Each one becomes a long sequence of visual tokens, and every token is processed at every Transformer layer. Compute balloons.
The road ahead
- 1 · The problem ~7 min Images and videos become long runs of visual tokens, every Transformer layer processes all of them, and the usual fix of deleting tokens loses evidence for good.
- 2 · What came before ~3 min
- 3 · The key idea ~9 min Keep every visual token, but replace their costly layer-by-layer updates with small low-rank adapters that build each layer's visual memory cheaply.
- 4 · Choose your own research ~3 min
- 5 · Build the method ~8 min Two probes show the visual pathway is low-dimensional and predictable; then adapters build each layer's visual memory, which text reads through frozen keys and values.
- 6 · The experiment ~6 min You’ll guess: Keeping every visual token instead of pruning, how did delta-Vision's accuracy compare with visual token pruning baselines at similar compute?
- 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.