SIEVE: Preserving Cross-Image Evidence via Depth-Aware Token Compression

SIEVE is a training-free method for multi-image vision-language models that uses up to 16× fewer visual tokens. At one eighth of the tokens, it retains 93–103% of the uncompressed accuracy across four open vision-language backbones and, on LLaVA-OneVision-7B, reduces prefill compute by 6.6× and the KV cache by 6.4×. It requires no fine-tuning, labeled data, or architectural changes.

Nitish Shukla1   Surgan Jandial2,*,†   Nhat-Tan Bui3,*   Arun Ross1

1Michigan State University  ·  2DatologyAI  ·  3Carnegie Mellon University
*Equal contribution  ·  †Work done at Carnegie Mellon University

up to 16×
fewer visual tokens
averaged over decoder depth
6.6×
less prefill compute
26.46 → 4.02 TFLOPs
6.4×
smaller KV cache
107.4 → 16.7 MB
1.9×
faster prefill
100.4 → 53.5 ms, one H100
0
training runs required
frozen weights; one forward pass
SIEVE at a glance
Overview of SIEVE. (a) Top: On COCO, attention to queried objects peaks in the latter half of decoder layers across backbones. Bottom: Fraction of global top-10% tokens assigned to the queried image (solid) and their overlap across questions (dashed), per backbone. Early rankings are largely query-agnostic, motivating per-image allocation and deferred attention-based selection. (b) Cumulative effect of each component at a 6.25% budget, averaged over five benchmarks. Pooling and budget scheduling provide most gains; progressive merging adds 2.27 points. (c) At a 12.5% budget, SIEVE leads on all five multi-image benchmarks with LLaVA-OneVision-7B, normalized to the uncompressed model (dashed ring: 100). (d) Three-image example: LLaVA-OneVision-7B answers correctly with only 6.25% of visual tokens. After per-image pooling, S(N) = 3 stages retain equal quotas per image and merge discarded tokens into their most similar retained tokens within the same image. Colors indicate the final token absorbing each region.

The challenge of multi-image compression

Vision-language models represent each image with hundreds of tokens, while the attention component of prefill compute scales quadratically with sequence length. A four-image question on LLaVA-OneVision contains 2,916 visual tokens before any text tokens are added. Applications such as document comparison, visual question answering over image galleries, and before-and-after inspection incur this cost on every request.

Token pruning reduces this cost, but when to prune is critical. Selection before the decoder lacks question-conditioned evidence; selection at later layers incurs the cost of processing the full sequence in earlier layers. Under a budget averaged over decoder depth, retaining all tokens through layer 2 already consumes 171% of a one-sixteenth budget. The initial layers alone therefore exceed the target.

Method overview

SIEVE combines three operations in a single forward pass with frozen model weights.

Panel (d) above illustrates the pooling and selection stages on a real question. The number of selection stages adapts to the image count, S(N) = clip(N, 2, 4): two stages for one or two images, three for three, and four for four or more.

Interactive token visualization

Select a question to explore SIEVE across decoder depths. Each image begins with 729 visual tokens, is pooled to a 10×10 grid, and is further compressed at each merging stage. Darkened regions indicate tokens that are no longer represented separately. All examples are precomputed from saved forward passes of LLaVA-OneVision-7B at a 6.25% visual-token budget, the setting used for the paper's qualitative figures.

Quantitative results

We evaluate SIEVE on four backbones and eleven benchmarks: five multi-image, four single-image, and two video. One configuration is used for all backbones, budgets, and benchmarks, with no benchmark-specific tuning.

Accuracy retained at one eighth of the visual tokens
percentage of each backbone's uncompressed five-benchmark average
LLaVA-OneVision 103% Qwen2.5-VL 93% Qwen3-VL 93% InternVL3 96% uncompressed SIEVE
Accuracy against prefill compute
Accuracy vs. compute on LLaVA-OneVision at 1/16, 1/8 and 1/4 of the tokens (five-benchmark average). SIEVE has the highest accuracy at every compute level and, at 1/8 and above, exceeds the uncompressed model (dashed, 63.12). x-axis: estimated visual-token prefill TFLOPs.

SIEVE retains 87–99% of each backbone's uncompressed mean at one sixteenth of the tokens and 93–103% at one eighth. On LLaVA-OneVision it exceeds the uncompressed model at one eighth and one quarter (65.13 and 66.64 vs. 63.12). At one sixteenth it has the highest mean on all four backbones, 9.96 points above the strongest baseline on LLaVA-OneVision and 1.72–2.54 on Qwen2.5-VL and Qwen3-VL. At one eighth it leads on three of the four backbones, by 0.76 to 9.03 points, and trails ToDRE by 1.52 points on InternVL3.

MethodLLaVA-OneVision-7BQwen2.5-VL-7BQwen3-VL-8BInternVL3-8B
No compression63.1270.8567.9168.28
One sixteenth of the visual tokens
VisionZip51.0458.2554.7858.39
FastV39.4841.0641.4439.07
PyramidDrop39.4841.0641.4439.07
AVTP39.7249.4842.7544.96
CLSE––43.57–
S²Prune47.0456.0452.2852.18
ToDRE52.2361.9556.2863.27
SIEVE62.1963.6758.8263.57
One eighth of the visual tokens
VisionZip56.1062.8458.6861.84
FastV41.1647.4652.1751.04
PyramidDrop41.6843.5349.9845.77
SparseVLM43.1152.3659.6254.94
AVTP44.2257.3051.3552.92
CLSE46.8961.3757.6359.06
S²Prune53.7263.1557.8459.28
ToDRE54.0065.4560.0466.73
SIEVE65.1366.2162.8365.21
One quarter of the visual tokens
VisionZip61.3966.1763.0264.62
FastV51.6962.2662.0965.94
PyramidDrop55.6562.1562.8565.04
SparseVLM54.8565.9866.1465.77
AVTP51.0663.5058.5359.43
CLSE56.7666.7863.7665.64
S²Prune58.8267.9162.6663.84
ToDRE58.8868.1563.9967.71
SIEVE66.6468.2665.1467.94

Each score is the average over Mantis-Eval, NLVR2, MuirBench, BLINK, and Q-Bench2. Bold marks the best result in each column and underline the second best. A dash marks a method that cannot run at that budget. At one sixteenth, FastV and PyramidDrop are left with a single token after reduction, so their schedules coincide and their rows are identical.

Integration and applicability

Citation

@article{shukla2026sieve,
  title   = {{SIEVE}: Preserving Cross-Image Evidence via Depth-Aware Token Compression},
  author  = {Shukla, Nitish and Jandial, Surgan and Bui, Nhat-Tan and Ross, Arun},
  journal = {arXiv preprint arXiv:2611.00351},
  year    = {2026}
}