- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper proposes GSRC, a neural reparameterization framework for 3D Gaussian Splatting compression. Previous methods need to explicitly store Gaussian positions or attributes, while GSRC represents the Gaussians implicitly as the output of networks. Specifically, it employs a coarse MLP to generate Gaussian positions from deterministic pseudo-random samples and a fine MLP with multi-resolution hash grids to predict Gaussian attributes. To achieve compression, the network parameters are optimized through rate-aware training and entropy-coded without relying on context models. The method is evaluated on NeRF-Synthetic, Mip-NeRF 360, Tanks&Temples, Deep Blending, and BungeeNeRF. Experimental results demonstrate competitive performance against existing Gaussian compression methods.
Critical strengths
- Novel framework for 3D Gaussian Splatting compression. The paper introduce a novel framework that eliminates the need to explicitly store Gaussian positions or attributes. Instead, it utilizes two neural networks to implicitly store Gaussian positions and attributes. GSRC is the first scene-specific 3D-GS compression framework that does not require storing explicit Gaussian or anchor set.
- Extensive experimental evaluation. The paper provides extensive experimental results across multiple benchmarks, with detailed comparisons against existing methods. The figures and tables are well presented and clearly illustrate the performance of the proposed method. Overall, GSRC demonstrates promising compression performance while maintaining competitive rendering quality
Critical weaknesses
- Limited discussion of related feed-forward Gaussian representations. Since the Gaussians are generated by neural networks, the proposed framework shares similarities with existing feed-forward Gaussian Splatting methods. Existing methods have already explored generating or representing Gaussian parameters using neural networks, including neural Gaussian compression. Although GSRC further eliminates the need to store explicit Gaussian positions or anchors, the paper does not sufficiently clarify how its neural reparameterization differs from these existing approaches. A more detailed discussion and comparison would help better establish the novelty of the proposed method.
- High optimization cost. Although GSRC achieves competitive compression performance and faster decoding, it requires substantially longer training time than existing methods. As shown in Table 2, GSRC takes 124 minutes per scene, compared to 54 minutes for HAC++. Since the neural networks are optimized separately for each scene and do not generalize to other scenes, it is unclear whether the additional training cost is justified by the storage savings.
Questions for authors
- Training stability. The proposed method generates Gaussian positions using pseudo-random samples from a fixed seed. Will the seed selection strategy affect the final reconstruction quality? In Appendix Figure 13, some runs are reported to have collapsed during rate-aware fine-tuning. Could the authors explain what causes these failures and how frequently they occur across different configurations? Does this indicate a potential stability issue with the proposed compression framework?
- Effectiveness and Applicability of GSRC-V. Although GSRC-V introduces a view-dependent decoder to provide more flexible Gaussian attribute prediction, it does not consistently improve rendering quality across datasets. Could the authors further clarify the effectiveness of the view-dependent decoder?
4 comments
Q1 — Seeds and collapses.
Our results show limited sensitivity to random seeds. To verify this, we retrained every table size on all datasets using three random seeds (Appendix A.6, Fig. 14, Table 5). The standard deviation of the dataset-mean PSNR is at most 0.04 dB on Mip-NeRF 360 and 0.12 dB on Tanks&Temples. Moreover, seed 0 differs from the three-seed mean by no more than 0.04 dB on Mip-NeRF 360, supporting the robustness of our original results.
Regarding the collapses, we traced them to an overly high learning rate multiplier for the position offsets inherited from 3D-GS, rather than an inherent instability of the framework. This affected 17 of the 120 Tanks&Temples models in the submission (all on Train, plus one each on Mip-NeRF 360 and Deep Blending). To address this, we reduced the learning rate by 8× and retrained all models. The revised experiments show improved training stability, with no collapses observed in Fig. 5.
Q2 — Effectiveness of GSRC-V.
We acknowledge that the benefits of GSRC-V vary across datasets. With the revised models, GSRC-V improves on GSRC on four of the five datasets (21–49 % fewer bytes at equal PSNR on NeRF-Synthetic, Mip-NeRF 360, Tanks&Temples and BungeeNeRF; Appendix A.5), but not on Deep Blending, where it is at parity at low rates and up to 0.19 dB below at high rates (Table 4).
The largest gain is observed on BungeeNeRF (49 % fewer bytes than GSRC, and 12 % fewer than HAC++), a large-scale scene captured from very different distances, whose views can be inconsistent. We attribute this improvement to GSRC-V's view-dependent decoder which adapts to the view direction and distance, as in Scaffold-GS/HAC++/etc, which can better absorb part of this inconsistency than a static set of Gaussians. This observation is consistent with KISS-GS, which similarly reports that anchor-based learned representations "better absorb capture inconsistencies" and we observe this effect on BungeeNeRF.
These gains come at an additional cost: GSRC-V requires 9–14% more storage at the same table size, with its view-dependent decoder accounting for approximately one-third of rendering time, alongside longer training (Table 7). We therefore consider GSRC-V particularly suitable for scenes with large scale variations or view-dependent appearance, while GSRC remains our default choice.
The authors have clarified my doubts in the rebuttal and I will raise my rating to 3-weak acceptance.
Thanks for your positive feedback and for raising your rating! We are glad that our rebuttal has addressed your concerns, and we sincerely appreciate your time and consideration.
We thank the reviewer for the careful review, and for noting that GSRC is the first scene-specific 3D-GS compression framework that does not store an explicit Gaussian or anchor set. We answer each point below and points shared with other reviewers are also summarized in the general response.
W1 — Feed-forward and neural Gaussian methods.
We agree that the difference from existing neural Gaussian methods deserves further clarification. We have added a paragraph, "Feed-forward Models for Gaussian Splatting", to §2 and clarified the key difference at the beginning of §3: what is stored to represent each scene. In particular:
Feed-forward reconstruction models (e.g. pixelSplat, MVSplat, GS-LRM) predict Gaussians fast with a network shared across scenes, without fitting the scene, but output an explicit set that still has to be stored or coded. Generative models (e.g. L3DG, DiffGS) decode Gaussians from a compact latent with a shared decoder, but are trained for a category of objects or rooms and are not optimized to compress a given scene. The feed-forward codec FCGS compresses an already-fitted explicit set, including their positions.
Neural Gaussian methods (e.g. Scaffold-GS, HAC++, ContextGS, NeuralGS) fit networks per scene, but still store anchors or positions explicitly. In contrast, GSRC reparameterizes the entire Gaussian scene, including positions, through scene-specific neural networks. Only the network parameters and a seed are needed to reconstruct the Gaussians, eliminating explicit position or anchor storage. The decoded Gaussians can then be rendered by a standard rasterizer, with fast decoding (0.86 s at T = 20, N = 2^22).
W2 — Training cost.
We acknowledge that GSRC requires longer training than HAC++ (54 min): 126–269 min depending on N (Table 7), and 130 min as the median over all models (Table 2). This reflects a trade-off between one-time encoding cost and storage and decoding efficiency. While the networks are optimized separately for each scene, GSRC achieves substantial storage savings (45% BD-rate reduction over our reproduced HAC++ results on Mip-NeRF 360), and decoding is 24–29× faster than HAC++. This trade-off is particularly relevant to scenarios where a scene is encoded once but stored, transmitted, and decoded repeatedly.
We also investigated reducing the optimization cost. Halving the training time reduces PSNR by only 0.12 dB, while GSRC still matches HAC++ at equal coded size on Mip-NeRF 360 (N = 2^20, against the published HAC++ results). Our current training pipeline has not yet been optimized for speed, leaving room for further improvements, such as meta-learning network initialization across scenes.