Region-Level Policy Optimization for Fine-grained MLLM Perception
Yuheng Shi, Xiaohuan Pei, Minjing Dong, Chang Xu
University of Sydney · City University of Hong Kong
Published September 17, 2026 · on the feed September 18, 2026 · ▲ 41 · arXiv 2609.19745
The abstract
Fine-grained visual perception in MLLMs is commonly improved by raising the resolution, but the added visual tokens inflate vision-encoding and language-model prefilling costs. We show that the two operations underlying fine-grained perception, localizing the region of interest (RoI) and recognizing its content, have different resolution requirements. In a controlled diagnostic, localization tolerates roughly 3 to 4 times stronger token compression than recognition, which motivates localizing from a coarse view and concentrating resolution on the selected evidence. Decoding coordinates with the MLLM can be trained end-to-end from answers, but costs a full model pass per query and depends on grounding ability. A lightweight proposal network distilled from the model's attention is fast, but inherits the noise of its attention targets. The RoI from the proposal network reaches the answer through a discrete region choice, so its faithfulness to the answer cannot supervise the network. We therefore optimize the proposal network with region-level reinforcement learning, which we call Vision-RL2. It treats coherent regions as actions, and a frozen MLLM reader scores each one by how its removal changes the answer likelihood. Complementary subtractive and additive objectives suppress distracting proposals and recover missing evidence, updating only the predictor without region annotations, response sampling, or reasoning trajectories. The refined proposal further enables a sparse encoding that magnifies evidence and excludes background tokens. Across six fine-grained benchmarks and four MLLM backbones, Vision-RL2 improves accuracy over the base model at every token budget and surpasses its largest-budget accuracy with about 4 times fewer visual tokens. Code is available at https://github.com/YuHengsss/VisionRL2 .
The Brief
3:02A short podcast summary of the paper. Written and voiced by AI.
Transcript
Region-Level Policy Optimization for Fine-grained MLLM Perception. By Yuheng Shi and three others, from the University of Sydney and the City University of Hong Kong. Published on the seventeenth of September. Its code repository is worked out: about six hundred and fifty source files, with a readme and a licence.
Fine-grained visual perception in multimodal language models is usually improved by raising the resolution. The extra visual tokens inflate the cost of vision encoding and of language-model prefilling. The authors show that the two operations underneath fine-grained perception have different needs. Localizing the region of interest and recognizing what is in it do not require the same resolution. In a controlled diagnostic, localization tolerates roughly three to four times stronger token compression than recognition. Finding where to look needs less detail than reading what is there.
That suggests a plan: localize from a coarse view, then concentrate resolution on the evidence selected. Two ways of localizing each fall short. Decoding coordinates with the model itself can be trained end to end from answers, but costs a full model pass per query and depends on grounding ability. A lightweight proposal network, distilled from the model's attention, is fast, but inherits the noise in the attention it learned from. And because its region reaches the answer only through a discrete choice, how faithful that region is to the answer cannot directly supervise the network. The network picks a region, the model answers, and nothing in between tells the network whether its pick was the one the answer depended on.
Vision-RL2 optimizes the proposal network with reinforcement learning at the level of regions. Coherent regions are treated as actions. A frozen model, acting as a reader, scores each region by how much removing it changes the likelihood of the answer. A region that matters is one whose absence the reader notices. The reader stays frozen throughout. It judges regions; it is not trained.
Two complementary objectives, one subtractive and one additive, suppress distracting proposals and recover missing evidence. Only the predictor is updated, with no region annotations, no response sampling, and no reasoning trajectories. One objective deals with what the proposal includes and should not, the other with what it leaves out and should not. The refined proposal also enables a sparse encoding that magnifies the evidence and leaves background tokens out. Magnifying the evidence gives recognition the resolution it needs, and leaving out the background is where tokens are saved.
Across six fine-grained benchmarks and four model backbones, Vision-RL2 improves accuracy over the base model at every token budget. It also surpasses the base model's accuracy at its largest budget while using about four times fewer visual tokens. The comparison is against the base model at its most expensive setting, and Vision-RL2 beats it with about a quarter of the visual tokens. Code is available.
The design follows from the diagnostic. Since finding the region needs less resolution than reading it, the expensive detail is spent only where the answer lives, and the region finder is trained on the one signal that actually says where that is: whether the answer changes without it.
Paper Quest · 7 chapters · about 40 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
More pixels, more cost. The wall here is reading fine detail without paying for the whole image at full resolution.
You want a multimodal model to read small text and spot distant objects. Raising the image resolution works, but every extra visual token adds encoding and prefilling cost.
The road ahead
- 1 · The problem ~6 min Seeing fine detail costs many visual tokens, finding the spot needs fewer than reading it, and a cheap spot-picker gets no word on whether it picked right.
- 2 · What came before ~3 min
- 3 · The key idea ~9 min Train the picker with reinforcement learning over whole regions, rewarding regions whose removal makes a frozen reader less sure of the correct answer.
- 4 · Choose your own research ~3 min
- 5 · Build the method ~8 min Start from an attention-distilled picker, split its map into regions, score each by removal, apply two objectives, then encode only the magnified evidence.
- 6 · The experiment ~6 min You’ll guess: To beat the base model's accuracy at its largest token budget, how many times fewer visual tokens did Vision-RL2 need?
- 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.