aspireai.
PUBLIC EDITION

LearnPrunerV2 kept 99.8 percent of a vision-language model's accuracy while discarding 77.8 percent of its visual tokens

AspireAI community · arXiv
LearnPrunerV2 turns visual-token pruning from a hand-tuned heuristic into a learned component, adding lightweight trainable modules to every layer of the vision-language backbone that score token importance by fusing intrinsic visual saliency with query relevance captured through a shadow token. The paper also identifies a staircase pattern in how redundancy accumulates across layers and uses it to set fixed per-layer budgets, which the authors argue is friendlier to real hardware than an adaptive schedule. On LLaVA-v1.5 the method preserves 99.8 percent of the original performance while pruning 77.8 percent of visual tokens, and the authors report consistent gains over previous state-of-the-art pruning methods across benchmarks and models. The evaluation is on LLaVA-v1.5, an older vision-language backbone, and the headline ratio says nothing about how the method behaves on models whose visual token budget was never the bottleneck in the first place.
Read the story and explore more from the AspireAI community.
Discover more stories
Stay curious.
THE BIG PICTURE
A FRESH PERSPECTIVE
Research
One distance function matched sparse-autoencoder features across layers and compressed feature circuits into supernodes
Two sparse-autoencoder analyses have resisted scaling: matching semantically similar features across layers, and compressing large feature circuits into interpretable supernodes. This paper argues both are the same underlying problem, estimating semantic distances between SAE features that sit on different activation manifolds. Its representation treats each feature not as a single decoder vector but as an activation-weighted distribution over the hidden states expressing it, projects those distributions into a shared reference space, and compares them with Wasserstein distance. The representation is proved invariant to activation rescaling and stable under perturbation, and recovers true matches under finite-sample margin conditions. Empirically it outperformed decoder-vector and LLM-based baselines and captured subtle functional distinctions between related features, and it compressed large feature circuits into interpretable supernodes automatically. The limitation is that this is interpretability tooling: the paper demonstrates better feature matching and circuit compression, not that downstream interpretability claims become more accurate.
Swipe into something new
01 / 1729
The conversation continues
Explore Builds — projects by Kiran Adimatyam ↗
A fresh perspective changes everything.
ASPIREAI — STAY CURIOUS.