VASC: Value-Aware Sparse Attention with Cross-Layer Memory for Efficient 3D Reconstruction

cs.CV Junyi Wu, Fanqing Kong, Leyang Chen, Shaoqiu Zhang, Yulun Zhang · Oct 1, 2026
Local to this browser
What it does
Feed-forward 3D reconstruction models like VGGT and $\pi^{3}$ rely on expensive quadratic global attention over long image sequences. VASC proposes a training-free sparse attention substitute that ranks block interactions by both query-key...
Why it matters
It achieves up to $2. 29\times$ faster inference than dense VGGT while improving pose and reconstruction accuracy over prior sparse baselines.
Main concern
VASC is a technically clean and well-ablated training-free accelerator for multi-view geometry transformers. The observation that high attention can coincide with locally similar values is sensible, and the queue-theoretic cross-layer...
Community signal
0
0 up · 0 down
Sign in to vote with arrows
AI Review AI reviewed
Plain-language introduction

Feed-forward 3D reconstruction models like VGGT and $\pi^{3}$ rely on expensive quadratic global attention over long image sequences. VASC proposes a training-free sparse attention substitute that ranks block interactions by both query-key relevance and adjacent-value contrast, then tracks unserved computational demand across layers via a lightweight cross-layer memory. It achieves up to $2.29\times$ faster inference than dense VGGT while improving pose and reconstruction accuracy over prior sparse baselines.

Critical review
Verdict
Bottom line

VASC is a technically clean and well-ablated training-free accelerator for multi-view geometry transformers. The observation that high attention can coincide with locally similar values is sensible, and the queue-theoretic cross-layer memory gives a principled way to compensate for fixed-budget execution. Still, the paper's key motivating visualization is hand-selected rather than representative, the in-collection hyperparameter search for FastVGGT adaptation is a weakness, and some reconstruction gains on 7Scenes are marginal. It is therefore a pragmatic improvement over FasterVGGT but not a dramatic leap in absolute accuracy.

“In an attention output $o_{i}=\sum_{j}a_{ij}v_{j}$, the weights describe query–key relevance, while the values supply the aggregated content.”
VASC paper · Section 3
What holds up

The two-part design is tightly motivated and empirically complementary. The value-aware term uses low-cost RMS contrast between adjacent pooled value blocks to modulate QK scores, while the memory update provides a clear, classical queueing-theoretic mechanism to carry unserved demand across layers. Ablations show that both components contribute, with value-aware selection growing in importance as sparsity tightens.

“$M_{l+1}(p)=[M_{l}(p)+a_{l}(p)-x_{l}(p)]_{+},\qquad M_{1}(p)=0.$”
VASC paper · Equation 6
“Its nonnegative recurrence follows classical queue accounting (Lindley, 1952; Neely, 2010), providing an execution-aware summary of allocation history.”
VASC paper · Section 2
Main concerns

The primary empirical motivation in Figure 3 relies on a manually chosen layer, head, and regions: "The layer and head were chosen by inspecting saved maps; the three regions were manually annotated. The maps illustrate an attention–value mismatch, while reconstruction reflects the full-network intervention. They are qualitative evidence, not a prevalence estimate or an isolated head-level causal test." This weakens the claim that attention-value mismatch is widespread. Additionally, the memory adaptation to FastVGGT uses hyperparameters "selected on two four-sequence subsets of the evaluated 18-sequence 7Scenes collection," which is in-collection adaptation rather than held-out validation. Finally, dense VGGT goes out of memory at stride 5, so the sparse baselines are not merely faster but necessary for denser inputs, making the speedup framing slightly misleading.

“The layer and head were chosen by inspecting saved maps; the three regions were manually annotated. The maps illustrate an attention–value mismatch, while reconstruction reflects the full-network intervention. They are qualitative evidence, not a prevalence estimate or an isolated head-level causal test.”
VASC paper · Appendix B.1
“We use current scale 5, memory weight 0.25, and arrival load 1.0, selected on two four-sequence subsets of the evaluated 18-sequence 7Scenes collection. Results characterize in-collection adaptation, rather than held-out generalization.”
VASC paper · Appendix E.1
Evidence and comparison

VASC beats FasterVGGT on most metrics across sparsity levels, backbones, and strides, with the largest gains at aggressive sparsity (S85). The authors note that "VASC improves all three pose metrics over FasterVGGT and FasterPi3 in every setting, and all six metrics at S75." However, the absolute improvements on 7Scenes reconstruction accuracy and completeness are small at moderate sparsity, and comparisons to FastVGGT are mixed (Appendix C.4). The paper does not report statistical significance, so minor metric differences are hard to interpret.

“VASC improves all three pose metrics over FasterVGGT and FasterPi3 in every setting, and all six metrics at S75.”
VASC paper · Section 5.2
“On NRGBD, VASC improves Comp and NC medians over FastVGGT; trade-offs remain in Acc and in 7Scenes NC at stride 5.”
VASC paper · Appendix C.4
Reproducibility

Reproduction should be straightforward in principle: the method is training-free, implementation details are given in Appendix A, and the authors state that "Code is available at https://github.com/kosakayamahoo-design/VASC." The main barriers would be matching the exact sparse kernel and GPU environment, since the timing protocol is specific ("average per-sequence medians of three passes after one warm-up" on A6000/RTX 4090). Reproducing the adapted-memory results for FastVGGT is less clear because the hyperparameters were tuned on a subset of the evaluation data.

“Code is available at https://github.com/kosakayamahoo-design/VASC.”
VASC paper · Abstract
“We average per-sequence medians of three passes after one warm-up, excluding loading and evaluation; comparisons use the same physical GPU.”
VASC paper · Section 5.1
Abstract

Feed-forward 3D vision models such as VGGT have achieved remarkable progress, unifying camera estimation and dense scene reconstruction in a single pass. However, their quadratic global attention makes long image sequences expensive, while existing sparse methods may favor highly attended yet value-redundant regions. To address these limitations, we introduce VASC, a training-free sparse attention method combining value-aware block selection and execution-aware cross-layer memory. Our value-aware block selection integrates pooled query--key relevance with neighboring value contrast, reducing redundancy while preserving query-relevant and distinctive content. Cross-layer memory tracks unserved demand across layers and updates this state according to actual execution, enabling previously underserved blocks to compete under a fixed computation budget. Experiments on 7Scenes and NeuralRGB-D with VGGT and $\pi^3$ demonstrate improved pose estimation and reconstruction quality compared with FasterVGGT, together with up to $2.29\times$ faster inference than dense VGGT. Code is available at https://github.com/kosakayamahoo-design/VASC.

Challenge the Review

Pick a starting point or write your own. Challenges run in the background, so you can keep reading while the AI investigates.

No challenges yet. Disagree with the review? Ask the AI to revisit a specific claim.