← Latest papers
💻 computer science

TwinPrune: Density-Aware Two-Phase Token Pruning for Vision-Language Models

TwinPrune introduces a unified density-aware two-phase token pruning framework that employs bipartite merge for prefill and KV eviction for decode, achieving superior efficiency-accuracy trade-offs across multiple vision-language models while highlighting the critical need for full-pipeline benchmarks to properly evaluate decode-phase compression.

Original authors: Kai Liu, Anqi Li, Junxian Li, Zhixin Wang, Zhikai Chen, Renjing Pei, Yulun Zhang

Published 2026-10-16
📖 4 min read☕ Coffee break read

Original authors: Kai Liu, Anqi Li, Junxian Li, Zhixin Wang, Zhikai Chen, Renjing Pei, Yulun Zhang

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine a computer trying to understand a photograph. To do this, the machine breaks the image down into thousands of tiny pieces, treating each piece as a distinct unit of information. As these models have become more sophisticated, they have learned to process these pieces with incredible detail, but this comes at a steep cost. The more detailed the image, the more pieces the computer must hold in its short-term memory to make sense of them. This creates a bottleneck: the computer runs out of space or takes too long to think, especially when the image is high-resolution or when the conversation requires a long, detailed answer. For years, researchers have tried to solve this by teaching the computer to ignore the less important pieces of the image, hoping to keep the smart ones and discard the rest.

However, a new study suggests that the way scientists have been testing these "ignore" strategies has been fundamentally flawed. For a long time, the field relied on tests where the computer only needed to give a single-word answer, like picking a letter from a multiple-choice list or saying "yes" or "no." The researchers behind this new work, called TwinPrune, discovered that these simple tests only measure how well the computer understands the image at the very beginning of the process. They fail to catch what happens when the computer has to keep talking, using its memory to generate long sentences. In fact, the study shows that a method could look perfect on these simple tests while completely failing when asked to write a longer description, because the simple tests never actually check the memory part of the process.

To fix this, the team developed a new way to decide which pieces of an image are worth keeping. Instead of looking at how much a piece of the image stands out to a specific question, they looked at how unique a piece is compared to its immediate neighbors. If a patch of the image looks very similar to the patches around it, it is likely redundant and can be safely removed. If it looks different, it likely holds important information. This "density" score is calculated once at the start and then used for two different jobs. First, it helps the computer merge similar pieces of the image together before it starts thinking, which saves computing power. Second, it helps the computer decide which pieces of information to throw out of its memory while it is writing a long answer, ensuring it keeps the most unique and useful details.

The researchers tested this approach on several different types of vision-language models, ranging from smaller ones to massive systems with billions of parameters. They compared their method against the strongest existing techniques using both the old, simple tests and the new, more demanding tests that require long answers. On the simple tests, their method performed just as well as the best competitors. But on the demanding tests, where the computer had to generate full sentences, the difference was stark. While other methods caused the computer's accuracy to crash when asked to be concise, the new method maintained high accuracy even when keeping only a tiny fraction of the original image data. For instance, on a specific benchmark involving text in images, the new method outperformed the next best technique by nearly ten percentage points when the memory was severely restricted.

Perhaps most importantly, the study revealed that the old way of testing had been hiding a major problem. When the researchers removed all the visual memory from the computer during the writing phase, the simple tests showed almost no change in performance, while the long-answer tests showed a massive drop in quality. This proved that the simple tests were blind to the very thing that matters most for real-world use: the ability to remember and retrieve information over a long conversation. The new method, by using a single, consistent rule to manage both the initial thinking and the long-term memory, managed to speed up the computer's initial processing by more than three times while also shrinking the memory footprint significantly.

The findings suggest that the field has been optimizing for the wrong metric. By shifting the focus to tests that require full, long-form answers, the researchers have shown that it is possible to make these powerful computers much faster and more efficient without sacrificing their ability to understand complex scenes. The approach works consistently across different model sizes, from small devices to the largest supercomputers, and does not require the computer to be retrained. It offers a practical path forward for deploying these advanced systems on everyday devices, ensuring they can handle high-resolution images and long conversations without running out of steam.

Drowning in papers in your field?

Get daily digests of the most novel papers matching your research keywords — with technical summaries, in your language.

Try Digest →