- Rating
- 3
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
FlashLVSM accelerates novel view synthesis by combining a DA3-based encoder, a shallow renderer, geometry-guided view selection (based on camera poses), target-aware token pruning, and mixed-precision inference. After jointly encoding and caching all source views, it renders each target using a fixed source-token budget. The reported rendering throughput remains around 140 FPS across 32–256 input views.
Critical strengths
The rendering speedups are substantial and supported by FPS, FLOPs, and memory measurements. At 64 views, the acceleration components increase throughput from 13 to 143 FPS, with a 0.60 dB PSNR reduction relative to the same base model. Component ablations, random-pruning controls, and quantization sensitivity analyses provide useful evidence for the design choices.
Critical weaknesses
-
The quality and efficiency advantage over competing efficient methods remains unclear. The main experiments focus on dense LagerNVS, while LaCT (already cited in the paper) also supports rendering costs independent of the input-view count after scene encoding. Given that FlashLVSM primarily combines established components, a comparison with this alternative would better establish its practical contribution and clarify the trade-off between retaining source tokens and compressing them into fast weights.
-
Another weakness is that FlashLVSM primarily combines established components. This may make the contribution feel incremental.
Questions for authors
See weakness 1. Could you compare FlashLVSM with LaCT under matched evaluation settings, reporting rendering quality, encoding cost, scene-representation memory, and rendering throughput?
3 comments
2. Contribution
We agree that view selection, token pruning, and FP8 inference are established techniques, and claim no novelty for them individually. Our contribution is in making them work together. First, the combination is not free: applied to LagerNVS, the same combination costs 4.00/3.69/2.98/2.31 dB at 32/64/128/256 views (Table 2 of the paper, +PQ), versus 0.78/0.60/0.47/0.42 dB for ours. Second, what makes it work is a property of the representation: a target can be rendered from the tokens of a few selected views. When 64 views are encoded and view selection passes only 8 to the renderer, the VGGT-based LagerNVS drops 3.55 dB while ours drops 0.24 dB (Table 14). Third, target-aware retrieval from an uncompressed cache is a distinct design point from compressive representations (scene tokens, CLiFT, LaCT fast weights), which reduce the context to a fixed summary before any target is known, and from query-agnostic token reduction (ToMe, FastVGGT), which reduces once for all targets; under a matched token budget, query-agnostic strategies are 0.9–2.7 dB below ours (Table R1-1 in our response to Reviewer aREE). We will revise the contribution statement to present these findings rather than list the techniques.
Thank you for the clarification and additional experiments. My concerns have been addressed, and I will maintain my rating of 3.
1. Comparison with LaCT
Grouped encoding. As explained in General Response C, we observe that the many-view degradation in the paper comes from encoding 32–256 views jointly, far outside the 2–6-view training setting. We therefore partition the source cameras into equal-sized groups of 4 or 6 views by clustering on camera position (with 6-view groups, a few views are repeated to fill the last group), normalize each group exactly as a training sample, and encode it independently; the cache is the same size as with joint encoding for 4-view groups and 0.8–12.5% larger for 6-view groups. Each target reads the group nearest to it — a group-level counterpart of our target-aware view selection — followed by the paper's pruning and FP8 (PQ), i.e., 5,184 or 7,776 source tokens (2,592 or 3,888 after pruning) instead of the paper's 10,368 (5,184).
Table 1. DL3DV 256$\times$256, feed-forward (PSNR↑ / SSIM↑ / LPIPS↓).
LaCT is strongest near its training view count of 32: at 32 views it is 0.5 dB higher in PSNR than ours with 6-view groups, and at 64 views the gap narrows to 0.3 dB. From 128 views on, ours is higher in all three metrics: by 0.7/1.2 dB in PSNR at 128/256 views with PQ, and 1.3/2.0 dB without. LPIPS is lower for ours at every view count, and SSIM from 64 views on. As the number of views grows, LaCT saturates (28.91 → 29.21 dB from 64 to 256 views), consistent with a fixed-size memory having to hold more views; ours keeps improving (28.59 → 30.42 dB with PQ), because every token is retained and each target reads its nearest group at the same cost.
Table 2. Cost at 256$\times$256 (LaCT / ours, 4-view groups / ours, 6-view groups). Ours is measured with PQ and includes group selection cost (0.4 ms); peak memory includes model weights (1.3–1.5 GB LaCT, 5.0 GB ours).
Encoding the scene is about 3$\times$ slower than LaCT's but linear in N, and its peak memory is lower than LaCT's from 128 views on, since LaCT's fast-weight update processes all context tokens at once. Rendering is 1.4–1.7$\times$ faster than LaCT and independent of N (5.6 ms, about 179 FPS, with 4-view groups, against 9.7 ms, about 103 FPS for LaCT); the cache grows with N and exceeds LaCT's fixed 324 MB beyond about 85 views.
Summary. LaCT writes the context into fixed-size fast weights and renders from a static network; we keep the context as tokens and let each target read a fixed budget of them. The two therefore differ in three trade-offs:
Neither design dominates; they are complementary. Combining LaCT-style fast weights for the global scene with retained tokens for target-dependent detail is a promising direction, and we thank the reviewer for suggesting the comparison with LaCT.