Good Token Hunting: A Hitchhiker's Guide to Token Selection for Visual Geometry Transformers
AuthorsShuhong Zheng, Michael Oechsle, Erik Sandström, Marie-Julie Rakotosaona, Federico Tombari, Igor Gilitschenski
Resources
This paper makes 3D visual geometry transformers much faster by cleverly choosing which image tokens to keep, cutting compute by over 85% while preserving accuracy.
Key results
GoToHunt reduces VGGT inference time from 288.0s to 41.2s on 500 images.
Base model runtime on 500 input images in the efficiency comparison.
Runtime of the proposed method on 500 input images.
What the paper found
Good Token Hunting, developed by researchers at the University of Toronto, the Vector Institute, Google, and the Technical University of Munich, reframes acceleration of visual geometry transformers as a constrained key/value token selection problem inside global attention. The paper shows that a two-stage hierarchy is decisive: first, inter-frame selection keeps a diverse set of anchor views using a K-center objective approximated by greedy farthest point sampling, and second, intra-frame selection applies layer-adaptive pruning guided by global-attention entropy, replacing the earliest layers with local attention and using more conservative downsampling where attention spikes. On 7-Scenes, Neural RGB-D, TUM-Dynamics, and Bonn, this training-free GoToHunt plug-in consistently matches or improves base-model quality while scaling much better than FastVGGT, SparseVGGT, Co-Me, LiteVGGT, and Speed3R. The clearest result is on 500-frame scenes, where it cuts VGGT inference time from 288.0s to 41.2s, an 85% reduction, and it also avoids Sparse-π 3 out-of-memory failures on long Bonn sequences. Across tasks, the method preserves camera pose, 3D point reconstruction, and video depth accuracy with near-linear time growth, showing that careful token selection can outperform brute-force token retention in long-context 3D vision.
Original abstract
Visual geometry transformers have become powerful architectures for multi-view 3D reconstruction, enabling joint prediction of multiple 3D attributes in a feed-forward manner. However, their computational cost grows quadratically with the input sequence length due to the global attention layers inside these models. This limits both their scalability and efficiency. In this work, we address this challenge with a simple yet general strategy: restricting the number of key/value tokens that each query interacts with during global attention. To achieve effective token selection, we introduce a two-stage framework. First, an inter-frame selection step operates at the frame level to identify frames that should be preserved. Second, an intra-frame selection step further discards more redundant tokens within the selected frames. Our analysis highlights the advantage of a diversity-based strategy for inter-frame selection, which ensures broad coverage of the scene. For intra-frame selection, we show that layer-aware sparsification is necessary, with the selection process guided by the entropy of the global attention pattern. Our approach offers a superior speed-accuracy trade-off compared to existing solutions. Extensive experiments show that it accelerates visual geometry transformers by over 85% for scenes with 500 images while maintaining, or even improving, baseline performance, which hints that how our token selection strategy can play a crucial role in future applications of visual geometry transformers. Our project website is available at https://zsh2000.github.io/good-token-hunting.github.io.
Read the original paperMore in Efficient AI
Browse all 55 papers →Decoding Looped Transformers Better for (Almost) Free
Weihao Liu, Huangjie Zheng, Tianrong Chen, Rohit Dilip, Richard He Bai, Yizhu Jiao, Yuyang Wang, Ruixiang Zhang
LoopCD turns the partially computed states of looped Transformers into free guidance, improving accuracy while often cutting inference compute nearly in half.
Scaling Laws for Looped Mixture of Experts
Yanbei Chen, Anirudh Goyal, Raghuraman Krishnamoorthi
This work develops scaling laws that explain how looping and sparse experts can be combined to build more capable models with less training and inference compute.
When Fancy Eviction Fails: Rethinking Cache Replacement For LLM Prefix Reuse
Yiyu Liu, Minlan Yu, Juncheng Yang
For LLM prefix caches, simple recency may beat fancy eviction rules, especially when workloads follow predictable session patterns.