PrePARE: Pre-AA Token Pruning for Frozen Multi-View Geometry Transformers
On the map: Efficient LLM inference and serving → Token pruning and merging for ViTs
Abstract (arXiv)
Multi-view geometry transformers are feed-forward 3D foundation models that jointly predict depth maps, point maps, and camera poses for N images in a single forward pass. Most of them build on an alternating-attention (AA) stack whose cross-view attention runs over the patch tokens of all N views in every block, so its cost grows quadratically in N: on 300-frame ScanNetv2 clips, VGGT peaks at 72.3 GiB, and MapAnything does not fit on a 93 GiB card. Existing methods reduce tokens or attention inside the AA stack, so the full patch grid still enters it, and the pre-AA interface, where the encoder hands its tokens to the first AA block, has been overlooked. We propose PrePARE, which prunes patch tokens once at the pre-AA interface and restores the dense grid once after the last AA block. Every block of the frozen AA stack then runs on the reduced tokens, while the prediction heads receive the full grid. A Token Scorer, supervised by how the unpruned AA stack uses each token, and a Feature-guided Restoration module are the only trained parts. The Token Routing module is rule-based. On ScanNetv2 at N = 300, PrePARE reduces the peak memory of VGGT by 80%, from 72.3 to 14.4 GiB, below every in-AA method we ran, and runs 5.4 times faster, while its per-scene Chamfer distance is lower than the unpruned model's on 34 of 50 scenes (sign test p = 0.015). On pi^3 and Depth Anything 3 it saves 15% and 20% of peak memory, where the in-AA methods save at most 9%, and at 1000 frames it is the only method we ran that fits Depth Anything 3 and MapAnything on one GPU.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in Token pruning and merging for ViTs, one of 12 directions in Efficient LLM inference and serving. Builds on 33 of its 43 references that are in the map. First posted on arXiv 8 May 2026.
Builds on
33 of 43 references.
Closest ancestors · 6
Same direction, newest first
- 2026Spark3R: Asymmetric Token Reduction Makes Fast Feed-Forward 3D Reconstruction7 May
- 2025LiteVGGT: Boosting Vanilla VGGT via Geometry-aware Cached Token Merging4 Dec
- 2025Co-Me: Confidence-Guided Token Merging for Visual Geometric Transformers18 Nov
- 2023DiffRate : Differentiable Compression Rate for Efficient Vision Transformers29 May
- 2022Token Merging: Your ViT But Faster17 Oct
- 2021Evo-ViT: Slow-Fast Token Evolution for Dynamic Vision Transformer3 Aug
Other references · 27
- 2023DINOv2: Learning Robust Visual Features without Supervisioncited by 7,974
- 2017ScanNet: Richly-annotated 3D Reconstructions of Indoor Scenescited by 3,117
- 2023FlashAttention-2: Faster Attention with Better Parallelism and Work Partitioningcited by 2,598
- 2021Vision Transformers for Dense Predictioncited by 1,803
- 2025VGGT: Visual Geometry Grounded Transformercited by 1,539
- 2021DynamicViT: Efficient Vision Transformers with Dynamic Token Sparsificationcited by 864
- 2025Depth Anything 3: Recovering the Visual Space from Any Viewscited by 692
- 2022Not All Patches are What You Need: Expediting Vision Transformers via Token Reorganizationscited by 363
- 2021AdaViT: Adaptive Tokens for Efficient Vision Transformercited by 362
- 2025π3: Permutation-Equivariant Visual Geometry Learningcited by 319
- 2025MapAnything: Universal Feed-Forward Metric 3D Reconstructioncited by 314
- 2021Neural RGB-D Surface Reconstructioncited by 313
15 more
- 2021Adaptive Token Sampling For Efficient Vision Transformerscited by 183
- 2025Streaming 4D Visual Geometry Transformercited by 161
- 2021IA-RED2: Interpretability-Aware Redundancy Reduction for Vision Transformerscited by 127
- 2025VGGT-Long: Chunk it, Loop it, Align it -- Pushing VGGT's Limits on Kilometer-scale Long RGB Sequencescited by 115
- 2023SparseViT: Revisiting Activation Sparsity for Efficient High-Resolution Vision Transformercited by 60
- 2026InfiniteVGGT: Visual Geometry Grounded Transformer for Endless Streamscited by 56
- 2025Block-Sparse Global Attention for Efficient Multi-View Geometry Transformerscited by 23
- 2025Quantized Visual Geometry Grounded Transformercited by 17
- 2025FlashVGGT: Efficient and Scalable Visual Geometry Transformers with Compressed Descriptor Attentioncited by 17
- 2026Speed3R: Sparse Feed-forward 3D Reconstruction Modelscited by 10
- 2025HTTM: Head-wise Temporal Token Merging for Faster VGGTcited by 9
- 2026STAC: Plug-and-Play Spatio-Temporal Aware Cache Compression for Streaming 3D Reconstructioncited by 9
- 2026HeSS: Head Sensitivity Score for Sparsity Redistribution in VGGTcited by 6
- 2025How Many Tokens Do 3D Point Cloud Transformer Architectures Really Need?cited by 4
- 2026S-VGGT: Structure-Aware Subscene Decomposition for Scalable 3D Foundation Modelscited by 2
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2025FastVGGT: Training-Free Acceleration of Visual Geometry Transformer
- 2023PPT: Token Pruning and Pooling for Efficient Vision Transformers
- 2025Similarity-Aware Token Pruning: Your VLM but Faster
- 2023Multi-Scale And Token Mergence: Make Your ViT More Efficient
- 2026Geometry-Guided 3D Visual Token Pruning for Video-Language Models
- 2026Scaling Vision Transformers Without Training: Prune-and-Merge Token Compression
- 2026VGGT-Prime: Compute-Adaptive Mixture-of-Heads for Efficient Visual Geometry Transformers
- 2021SPViT: Enabling Faster Vision Transformers via Soft Token Pruning