- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
Existing methods for uncertainty estimation for 3DGS produce heatmaps/score that rank pixels from most to least certain based on the area under the sparsification curve (AUSE) and rank correlation. This ordering does not contain any information about how wide the error interval could be. L43-46 gives an example of methods that miss 10 % of the pixels: one method misses 10 % in all views, and another method misses 20 % in half the views and 0 % in the rest, but their pooled coverage is the same.
The paper asks a question for each new view: "With probability at least , does a new rendering cover at least a fraction of its pixels?" The main contributions are as follows:
- The authors split uncertainty into two parts: a) spatial shape from the renderer, which denotes which pixels within a view are harder, and b) difficulty factor for each view, which denotes how hard that view is.
- Reusable view difficulty factor which needs to be trained on source views and then can be reused for any new scene.
Critical strengths
- [S1] The authors present enough comparisons against pixel-pooled CP in Fig. 2 and Fig. 4. This further motivates the main claim of the paper.
Critical weaknesses
-
[W1] The writing is too dense and convoluted. Further, the Conclusion section is just 4 sentences and restates the general motivation. It lacks the structure required for a manuscript submitted to a top-tier conference.
-
[W2] Saving % is the main result metric discussed by the authors. However, it is not defined explicitly anywhere in the manuscript.
-
[W3] In Table 2, the learned view factor beats the per-view average by only one point. The authors did not present results for a variant ?
Questions for authors
- [Q1] Why Vanilla 3DGS only on just 3 scene views?
- [Q2] Does the approach work for other representations like 3DGS-MCMC?
- [Q3] How robust is the claim in L429-430? The authors claim that VSCP transfers without any fitting to Mip-NeRF 360 scenes. All the scenes in the Mip-NeRF 360 dataset are around an object. Do these results transfer to scenes in ScanNet++ or DL3DV-10K scenes?
- [Q4] Does this approach work for sparse-view setting ?
- [Q5] How sensitive is the approach to changing lighting conditions in the scene?
2 comments
Thanks to the authors for their response. My unaddressed concerns are as follows:
- [Q2] 3DGS-MCMS uses a more robust densification strategy than the heuristic-based adaptive density control methods described in vanilla 3DGS and Fast-GS. It will be interesting to verify the sensitivity of VSCP across different densification schemes and Gaussian budgets. A similar analysis can be performed for different pruning strategies, such as PUP-3DGS.
- [W3] The new comparison shows that the learned factor beats only by a margin. Are there settings in which the learned factor will outperform other variants by a large margin? As you have already concluded, most of the gains come from estimating and shrinking the two parts separately. Further analysis of the learned factor will improve clarity on this mechanism.
Response to Reviewer 3 (2/2)
R3.5 (Q1). Why vanilla 3DGS on only three scenes?
We first used three scenes because vanilla densification produces 5.6–7.7× more Gaussians, and we have now extended the study to all three protocols. Doing so exposed a bug. The prior in Table 11 did not exclude the target scene, so the three original scenes now save 17.7% instead of 20.6% (Correction 1). The view regressor is never refit on vanilla models, and the strict row uses the four-source shrinkage for both backbones.
Every interval includes zero, so we detect no difference between backbones, but the intervals are too wide to claim equivalence within 2 points. Room drops most (−11.5 points leave one out, −10.3 strict), so a backbone change keeps most of the saving, with room as the exception. View-event coverage is 89.0–93.5%. The lowest value (treehill, 89.0%) is Monte Carlo error of the 200 splits, since the exact mean over all 31,824 splits is 11/12 = 91.7%.
Revision. Table 11 has six scenes (L1297), and Table R3 (Appendix D.7, L1310) adds the two transfer protocols. Appendix D.7 gives the treehill check (L1291–1295), and Appendix D.9 the corrected room value (L1345).
R3.6 (Q2). Other representations such as 3DGS-MCMC
We have not tested 3DGS-MCMC, so we make no claim for it. The method needs only a trained 3DGS whose Gaussians can carry the residual field and the support statistics. 3DGS-MCMC changes how Gaussians are created and moved, the same kind of change as our vanilla study, which does not cover it. The guarantee holds for any fixed scale (Theorem 1), but we have no width results for it.
Revision. Appendix E lists 3DGS-MCMC and other density-control schemes as untested (L1619–1620).
R3.7 (Q3). Scenes that are not object-centric (G3)
On three DL3DV-10K scenes, validity and the saving over the constant both transfer without refitting, but the advantage over field-based baselines does not. ScanNet++ needs a data license that we could not obtain in time. Before training we fixed the selection rule. In each of the indoor, urban and natural categories, we took the first scene in hash order whose camera path spans less than 180° in azimuth. Each scene uses one FastGS model at 960×540, the strict prior and four-source shrinkage.
Ours beats the constant on 3/3 scenes and 3DGS-U on 2/3 (+2.26 [−4.85, 6.27], not significant), against +5.06 on Mip-NeRF 360. Against b̄_v × b̃ with λ_b = 0.5 the margin is only +0.86. On Botanical-Gardens the transferred view factor hurts (alone it is 8.77% wider than the constant). A post-hoc diagnostic (Appendix D.16) explains this scene and kitchen, but it needs test labels. View-event coverage is 91.9–93.8% for every row. Averaged over all splits it equals 13/14 for any scale, so it checks the code rather than the method.
Revision. New Appendix D.15 (L1527, Table R6) and D.16 (L1554). Section 6.4 states the result and its limits (L476–477).
R3.8 (Q4). Sparse-view setting (G3)
View-CP is not designed for the sparse-view setting, because it needs at least m = 9 labeled held-out views at α = 0.1, the floor of any finite split-conformal threshold (Appendix C.5). With very few captured views, holding out nine would remove most of the training data. When extra labeled views exist, the guarantee still holds for a sparse-view model, but we have not measured the width there.
Revision. Appendix E states this requirement and names the sparse-view setting as out of scope (L1613–1616).
R3.9 (Q5). Changing lighting
The answer depends on whether the lighting change breaks exchangeability, and we have not run a lighting experiment. If calibration and test views come from the same capture, the guarantee holds by Theorem 1, and changing light affects only the width. If lighting differs between calibration and test views, as in photo collections taken over time, exchangeability fails, and the arc result of R1.1 shows that coverage can then drop well below target. Such data also needs an appearance model in the center, which is outside our scope.
Revision. Appendix E adds lighting change across captures to the stated scope limits (L1624–1626).