- Rating
- 2
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
This paper presents HashMod, a lightweight plug-and-play refinement module for feed-forward 3DGS. It uses patch-wise binary hash matching to adaptively select relevant backbone feature levels and aggregates the predicted offsets from these levels to refine the original Gaussian parameters. Experimental results show that HashMod generally improves reconstruction quality and achieves comparable performance with fewer fine-tuning iterations.
Critical strengths
The motivation is reasonable, as different local regions may benefit from different levels of backbone features for Gaussian refinement. The proposed method is also simple, lightweight, and easy to follow, making it practical to integrate into existing feed-forward 3DGS models.
Critical weaknesses
- The motivation for using binary hashing is not very clear. The idea of selecting different feature levels for different regions makes sense, but why does this selection need to be based on binary hashing? Why not simply use cosine similarity or other conventional similarity measures? Since there are only a few feature levels to choose from, it is also unclear what advantage binary hashing offers. The paper does not discuss this design choice or provide comparisons with these simpler alternatives, making it difficult to see why hashing is necessary here.
- It is unclear whether the improvements actually come from hash-guided selection. HashMod adds extra refinement heads, which also introduce more parameters. Since the performance gains are quite small, I wonder if simply adding these refinement heads would achieve similar results even without hashing. The paper does not provide a fair comparison to clarify this.
Questions for authors
- Could the authors compare binary hashing with simpler alternatives, such as cosine similarity or other conventional similarity measures, to show why binary hashing is necessary?
- Could the authors provide a baseline that simply adds the same refinement heads without hash-guided selection? This would help clarify whether the improvements come from hashing or just the extra refinement heads.
- In Fig. 3, the zoomed-in details are only shown for the models without HashMod, rather than comparing the same model with and without HashMod. Could the authors provide side-by-side zoomed-in comparisons? The current figure makes it difficult to see what HashMod actually improves.
3 comments
Response to rebuttal
Thank you for the detailed response and the additional experiments and visualizations. The lower training loss and improvements at intermediate checkpoints are encouraging.
As the final results are close to those of adaptive gating and the no-selection baseline, it would be helpful to further clarify the practical benefits of binary hash-guided selection, for example in terms of training efficiency or computational cost, and reflect this nuance in the paper.
Thank you for this helpful follow-up. We have clarified the practical benefits in Sec. 4.1, under “Comparison of parameters and training efficiency.” Table 3 reports approximately 41–42% less total fine-tuning time relative to the original baselines, achieved through fewer training iterations. Appendices A.3–A.5 provide the convergence curves and controlled comparisons with adaptive gating and the no-selection baseline. These sections emphasize the observed benefits in training optimization while noting that the final reconstruction results are comparable, reflecting the nuance you highlighted.
Thank you for your constructive review and for recognizing the motivation and practical design of HashMod. To address your concerns, we have added cosine-matching and adaptive-gating comparisons, a baseline with the same refinement heads but no selection, and paired zoomed-in visualizations. We hope these additions clarify the contribution of the proposed design and would appreciate your reconsideration of the paper based on the updated evidence.
Critical Weaknesses:
W1 Motivation for binary matching
Thank you for this comment. We have added comparisons with continuous cosine matching and parameter-matched adaptive gating to evaluate this design choice directly. The observed benefit lies in lower training reconstruction loss and modest differences in final quality, rather than an advantage in searching over many candidate levels. We will clarify the empirical motivation for binary matching. The settings and results are detailed in our response to Question 1 below.
W2 Contribution of the additional heads
Thank you for this suggestion. We have added a baseline retaining the same four refinement heads while summing all corrections without selection, with n = 4 at every patch. Its final reconstruction quality is close to HashMod, while HashMod has lower training reconstruction loss and improvements at some intermediate checkpoints. The detailed comparison is provided in our response to Question 2 below.
Q1 Comparison with cosine and gating
Thank you for this suggestion. We have added both cosine matching and parameter-matched adaptive gating baselines. The cosine variant removes query/key binarization and computes continuous cosine similarity, keeping the remaining architecture unchanged. The gating baseline retains the same four refinement heads and routing-network parameter count, replacing binary matching and discrete selection with continuous matching and independent sigmoid gates. HashMod has lower training reconstruction loss at every recorded epoch. Under the same training budget, the epoch-10 test results are shown below.
The cosine comparison examines binary versus continuous matching, while the gating comparison evaluates the routing design under matched parameter capacity. HashMod improves all three final metrics over cosine matching and achieves comparable quality to gating, with slightly better PSNR and LPIPS. These results provide empirical support for the chosen matching design, with the clearest observed difference in training reconstruction loss. Implementation details and final results are provided in Appendix A.4 (Comparison with Alternative Routing Mechanisms), Table A2. Full curves are provided in Appendix A.3 (Training Convergence and Equal-Iteration Comparisons), Fig. A2.
Q2 Same heads without selection
Thank you for this suggestion. We have added HashMod w/o Selection, which retains the same four refinement heads but sums all their corrections without hash-guided selection, fixing n = 4 at every patch. The multiplicative refinement formulation and training settings remain unchanged. This controls for the additional refinement heads when assessing the contribution of selection. HashMod achieves lower training reconstruction loss at every recorded epoch. The test curves also show improvements at some intermediate checkpoints. For example, at epoch 8, HashMod achieves 21.516 dB PSNR, 0.732 SSIM, and 0.301 LPIPS, compared with 21.460 dB, 0.731, and 0.304 without selection. At epoch 10, the two variants reach comparable reconstruction quality.
These results indicate that selection's observed benefit is more evident in training optimization than in the final reconstruction scores. The same heads can reach similar final quality when all levels are aggregated, while adaptive selection lowers training reconstruction loss and provides improvements at some intermediate checkpoints. The baseline and matched-epoch results are detailed in Appendix A.5 (Same Refinement Heads without Selection), Table A3. Complete training and test curves are provided in Appendix A.3, Fig. A2.
Q3 Paired detail comparisons
Thank you for this suggestion. We have updated Fig. 3 with zoomed-in comparisons for each model with and without HashMod.