- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
The paper applies the idea of training-free looping to five frozen geometry models: VGGT, Pi3, DA3, MapAnything and VGGT-Ω. A contiguous block window is replayed K times with a damped Euler update. In terms of experimental evaluations, the authors measure across 10 benchmarks covering pose, reconstruction and depth. The empirical advantages are not stable. For example, VGGT's HiRoom F1 rises from 53.79 to 60.43 while the differences are minor for other backbones and other datasets.
Critical strengths
- The proposed method is purely training-free. The user can extend it to new base models without adding any parameters.
- The authors provide careful engineering to handle pair granularity, special tokens and dense-head feature caches.
- The paper also offers broad evaluations across five backbone networks and 10 benchmarks.
Critical weaknesses
- The evaluation configurations are selected on the test benchmarks. Each configuration is picked from candidates using aggregates over the same benchmarks reported with a different selection rule per model. No held-out evaluation is given. Moreover, DA3's chosen setting is the only one of 318 that improves all six aggregates and some of its margins are tiny (+0.06% AbsRel), which looks like noise.
- Gains concentrate on HiRoom but without uncertainty estimates. Excluding HiRoom, VGGT's aggregates fall to +0.35 AUC@3, −0.05 AUC@30 and +0.83 F1. And reconstruction distance gets slightly worse (−0.28%). Most other deltas are very minor (e.g. ≤0.1 pp) on benchmarks with 7–14 scenes.
- Novelty is limited. The damped sub-step update and its ODE motivation shares the same idea of Chen et al. [1] and Déjà View [2] which already studies looping for multi-view reconstruction and evaluates against the same five baselines. So the contribution is mainly architecture adapters plus an empirical study, which raises the bar on W1 and W2.
- Controls that would isolate the mechanism are missing. There is no naive-repetition baseline, no zero-cost residual-rescaling baseline (h_0 + c(a−h_0)) and no random-perturbation baseline. Eq. 3 is never compared against simpler cache readouts and K is limited to {2, 3, 4}.
- Compute cost is not reported. Appendix H gives only evaluation-pipeline throughput, not loop latency. VGGT [5,8]/4 adds roughly 50% backbone FLOPs but there are no latency or memory numbers and no compute-matched comparison. Given the minor experimental gains from this submission, the introduced extra running costs might be problematic to practical usage.
- The analysis is narrow and partly confounded. It is HiRoom-only and uses overlapping windows. Controlling for window start, Pi3's similarity–gain association drops from 0.675 to 0.320 while DA3 and MapAnything show weak or no association. The abstract's claim about representation structure is therefore overstated.
- There are no visual comparison figures for camera trajectories. Also the qualitative demonstrations for 3D reconstruction are also limited. Can you show more visual improvements for each chosen base model? Please also report which sequence is used.
[1] Chen et al., Training-Free Looped Transformers, 2026.
[2] Burzio et al., Déjà View: Looping Transformers for Multi-View 3D Reconstruction, 2026.
Questions for authors
Please see the weakness part.