- Rating
- 3(+1)
- Confidence
- 2
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
RLSplat makes feed-forward 3DGS budget-controllable in inference cost, not just output size: prior methods predict a dense candidate set and prune/select, so latency and memory stay nearly constant. It learns a Gaussian allocation policy that distributes a requested number of Gaussians across anchors, and decodes them with a resource-linear decoder using local cross-attention over a small neighborhood. On zero-shot transfer it achieves the best quality at every budget, near-flat quality as the budget shrinks, and beats budget-fixed methods with far fewer Gaussians, with component ablations.
Critical strengths
- Correctly targets resource-linear inference, which is the right problem for deployment-oriented FF3DGS, with an elegant allocation formulation.
- Consistent quality gains at every budget, near-flat quality under budget reduction, and thorough component ablations.
Critical weaknesses
- Evaluation breadth is limited: a single zero-shot benchmark at low resolution, and in-domain measurements are missing.
- A few reproducibility/clarity issues remain: a prior baseline appears under the same name as the proposed method, naming is inconsistent across the paper, and Eq. (3) appears degenerate as printed.
Questions for authors
- In-domain quantitative results would be a welcome addition to complement the zero-shot evaluation.
- Could the authors quantify the policy-training overhead relative to base training?
2 comments
Thank you for the thoughtful response. All of my concerns are addressed. Therefore, I'll raise my score.
Response to Reviewer DbVA
We thank the reviewer for recognizing resource-linear inference as the right problem for deployment-oriented FF3DGS and for the constructive feedback on evaluation breadth and clarity. We add in-domain RE10K (Table 2) and higher-resolution Mip-NeRF 360 (Appendix I) evaluations, report the policy-training overhead, and revise the manuscript for clarity, including consistent naming and an explanation of Eq. (3). We address each point below.
[W1, Q1] Additional in-domain and higher-resolution experiments
Following the reviewer's suggestion, we have added quantitative evaluations on RE10K (in-domain) and Mip-NeRF 360 (higher-resolution, cross-dataset).
Table A. In-domain evaluation on RE10K (16 input views). Budgets in Gaussians per view (1K = 1,024); best per budget in bold. F⁴Splat† is a low-budget checkpoint we retrained (five multi-scale feature maps instead of three). Full results in Table 2 of the revised manuscript.
Table B. Mip-NeRF 360 (16 input views). #GS denotes the total Gaussian count per scene. Best results are bold.
(1) In-domain evaluation on RE10K. We evaluate all methods with 8, 16, and 24 input views at budgets of 4K, 2K, and 1K Gaussians per view. RLSplat outperforms both baselines on all three metrics across all budgets and input-view counts, and its PSNR advantage over F⁴Splat† grows as the budget tightens, from 0.97 dB at 4K/view to 1.49 dB at 1K/view.
(2) Higher-resolution evaluation on Mip-NeRF 360. We evaluate at 448 × 448 input resolution (vs. 256 × 256 in the original experiments) against baselines that support higher-resolution inference. RLSplat achieves the best results on all three metrics, improving PSNR by 2.80 dB over F⁴Splat at the same Gaussian count and by 2.58 dB over the strongest baseline, DepthSplat + ZPressor, with about 10× fewer Gaussians. The full results and evaluation protocol are provided in Appendix I of the revised manuscript.
[Q2] Policy-training overhead compared to Base training
Table C. Training cost of base training and GSPO policy training (rollout group size C = 5).
GSPO policy training adds 1h 58m (19.0% of the base training time) and increases peak VRAM by 13.5%. Although each step renders C = 5 candidate allocations for the reward, the rollouts are forward-only and 3DGS rasterization is fast and lightweight, so both overheads remain far below 5×. This overhead is incurred once during training and does not affect inference latency or memory.
[W2] A prior baseline appearing under the same name as the proposed method, inconsistent naming, and Eq. (3) appearing degenerate
Baseline sharing the method's name. GSPO refers to Group Sequence Policy Optimization (Zheng et al., 2025), which we adopt as the optimizer for our allocation policy; it is not itself our contribution. Labels such as "GSPO (Ours)" in the original manuscript could suggest otherwise. In the revision, RLSplat denotes our method and GSPO refers only to the optimization algorithm, and all tables and figures follow this convention.
Inconsistent naming. We have standardized method names throughout the manuscript (EcoSplat, F⁴Splat, NoPoSplat, SPFSplat, AnySplat, and RLSplat) and verified that all row labels, legends, and figure annotations match.
Regarding Eq. (3). The ratio in Eq. (3) equals one in value but not in gradient. Each rollout group is sampled from the current policy and used for exactly one update, so the denominator is the current probability with gradients stopped, sg(pn). The gradient therefore flows only through the numerator, which yields a length-normalized policy gradient weighted by the advantage in Eq. (4), following GSPO-token (Zheng et al., 2025, Sec. 4.3). We have added this explanation right after Eq. (3).
We have addressed each point based on our best understanding of the comment. If the reviewer could point us to the specific locations, we will correct them immediately.