ReSS: Residual-Restoring Sparse Attention for 3D Vision Transformers
Not on the map. Why?
Abstract (arXiv)
3D vision transformers such as VGGT predict camera poses and scene geometry from multi-view images in a single forward pass, but their global attention over all concatenated view tokens dominates computation as the number of views grows. To reduce this cost, SparseVGGT and HeSS sparsify attention at the block level, and both retain blocks with high attention probability. However, we observe that attention probability poorly predicts how much the model's behavior actually changes when a block is removed, and we show that this mismatch is why performance collapses as sparsity increases. In this paper, we propose ReSS (ReSidual-ReStoring Sparse Attention), which recasts block selection from a problem of maximizing the retained attention mass to one of minimizing the drift that sparsification leaves in the residual stream. We introduce a drift score that quantifies how much each block shifts the residual, and, since the drift of a drop set depends on the directions of the contribution vectors rather than on their magnitudes alone, an iterative residual restoration procedure that refines the drop set as a whole. Across three backbones and five datasets, ReSS preserves dense performance better than prior methods at matched sparsity. Two further results support drift as the quantity that governs the cost of sparsification: maximizing drift degrades performance faster than random selection, and plotted against realized drift instead of sparsity, all methods fall approximately onto a single curve. Code is available at https://github.com/libary753/ReSS.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 24 of its 33 references that are in the map. First posted on arXiv 28 Sep 2026.
Builds on
24 of 33 references.
References · 24
- 2023DUSt3R: Geometric 3D Vision Made Easycited by 1,526
- 2025VGGT: Visual Geometry Grounded Transformercited by 1,475
- 2022Token Merging: Your ViT But Fastercited by 995
- 2023ScanNet++: A High-Fidelity Dataset of 3D Indoor Scenescited by 747
- 2021Common Objects in 3D: Large-Scale Learning and Evaluation of Real-life 3D Category Reconstructioncited by 646
- 2025Depth Anything 3: Recovering the Visual Space from Any Viewscited by 626
- 2024MInference 1.0: Accelerating Pre-filling for Long-Context LLMs via Dynamic Sparse Attentioncited by 375
- 2025π3: Permutation-Equivariant Visual Geometry Learningcited by 292
- 2025Sparse VideoGen: Accelerating Video Diffusion Transformers with Spatial-Temporal Sparsitycited by 204
- 2025Streaming 4D Visual Geometry Transformercited by 147
- 2025XAttention: Block Sparse Attention with Antidiagonal Scoringcited by 131
- 2025TTT3R: 3D Reconstruction as Test-Time Trainingcited by 122
12 more
- 2025FlexPrefill: A Context-Aware Sparse Attention Mechanism for Efficient Long-Sequence Inferencecited by 121
- 2025VGGT-Long: Chunk it, Loop it, Align it -- Pushing VGGT's Limits on Kilometer-scale Long RGB Sequencescited by 107
- 2025Sparse VideoGen2: Accelerate Video Generation with Sparse Attention via Semantic-Aware Permutationcited by 100
- 2024Attention Score is not All You Need for Token Importance Indicator in KV Cache Reduction: Value Also Matterscited by 73
- 2025CriticalKV: Optimizing KV Cache Eviction from an Output Perturbation Perspectivecited by 28
- 2025Block-Sparse Global Attention for Efficient Multi-View Geometry Transformerscited by 22
- 2025LiteVGGT: Boosting Vanilla VGGT via Geometry-aware Cached Token Mergingcited by 16
- 2025OBCache: Optimal Brain KV Cache Pruning for Efficient Long-Context LLM Inferencecited by 9
- 2025Co-Me: Confidence-Guided Token Merging for Visual Geometric Transformerscited by 9
- 2026SVG-EAR: Parameter-Free Linear Compensation for Sparse Video Generation via Error-aware Routingcited by 9
- 2026HeSS: Head Sensitivity Score for Sparsity Redistribution in VGGTcited by 5
- 2025KV Admission: Learning What to Write for Efficient Long-Context LLM Inferencecited by 3
Built on by
Not cited yet.