- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes a general post-training 3DGS compression framework that aims to minimize model storage under rendering-quality constraints and a limited evaluation budget, without per-scene fine-tuning. The framework combines spatial block-wise quantization with signed-power companding of higher-order SH coefficients to reduce quantization distortion and expand the set of feasible compression configurations. It further introduces a budgeted configuration search strategy based on Gaussian-process predictions to jointly select the pretrained base model, spatial block size, and SH precision while satisfying mean and tail PSNR-loss constraints. An independent confirmation stage evaluates the selected configuration on disjoint views, with a losslessly encoded reference used as a fallback when the quality constraints are not met. Experiments across multiple 3DGS benchmarks demonstrate reduced model sizes, competitive rendering quality, and high rendering throughput, while ablation studies examine the effects of companding, configuration search, and quality-aware delivery.
Critical strengths
-
The proposed framework enables 3DGS compression without per-scene fine-tuning, making it suitable for compressing pretrained Gaussian representations. The reported compression time is approximately 58 seconds per scene, excluding base-model construction, while maintaining competitive rendering quality and high rendering throughput.
-
The paper provides extensive experiments across multiple datasets, including controlled comparisons of uniform and companded quantization over 192 matched configurations. The ablation studies further investigate configuration search, quality constraints, and confirmation mechanisms, providing useful insights into the effectiveness and limitations of individual components.
Critical weaknesses
-
The proposed framework primarily integrates established techniques rather than introducing fundamentally new compression algorithms. Specifically, the signed-power companding used for SH coefficients is a classical nonuniform quantization technique, while the budgeted configuration search builds upon Gaussian-process-based constrained optimization. Similarly, the independent quality confirmation and lossless fallback mechanisms are largely adaptations of conventional validation and quality-control strategies. Although combining these components into a post-training 3DGS compression framework is practically motivated, the methodological contributions appear largely incremental, and the paper does not sufficiently establish what is technically novel beyond adapting and integrating existing approaches.
-
Although the paper presents the framework as a general post-training 3DGS compression method, all experiments rely on Gaussian representations produced by FastGS-based training pipeline, with different densification schedules. The proposed codec is not evaluated on representations obtained from other 3DGS training methods. Since the effectiveness of SH companding and the selected quantization configurations may depend on the attribute distributions of the pretrained models, the claimed generality remains insufficiently validated.
Questions for authors
-
While companding improves quantization distortion and expands the set of feasible configurations, Table 1 shows that the full method achieves a larger average delivered size than Uniform Quantization with the same local-mean search strategy (16.856 MiB vs. 15.680 MiB). Could the authors explain this discrepancy and clarify under which conditions companding consistently improves the final compression performance?
-
The authors present the proposed method as a general post-training 3DGS compression pipeline. However, all experiments are conducted on Gaussian representations obtained from the FastGS-based training pipeline. Could the authors evaluate the proposed method on 3DGS representations trained using other methods, such as the original 3DGS, to further validate its generality?
9 comments
Q2 : Why Companded Can Be Larger After Fallback
Thank you for the question. We clarify that Table 1 compares final delivered size, not the size of candidate bitstreams under the same configuration. The larger final size of Companded mainly comes from fallback after a confirmation failure, rather than from companding directly increasing the bitstream size.
1. Why Companded Has a Larger Final Size in Table 1
Our size calculation is as follows:
-
Each candidate configuration is actually encoded into an
.npzfile, and the true file size in bytes is recorded rather than the theoretical entropy or an estimated size. -
If the candidate satisfies both a mean PSNR loss of no more than 1.0 dB and a CVaR10 tail loss of no more than 1.5 dB on the independent confirmation views, the final size is the actual bitstream size of that candidate.
-
If confirmation fails, the entire delivery is replaced by the lossless bitstream of the reference model, rather than the delivery result from Uniform.
Therefore, an improvement in rate-distortion at the candidate level does not necessarily translate into a reduction in delivered file size. For an explanation of why a confirmation failure immediately triggers lossless reference delivery, please see our response here: OpenReview response to SEZk.
2. Common-Budget Supplementary Experiment and Conditions for Consistent Improvement
We further conducted a budget experiment using the same candidate pool, the same local_mean strategy, and the same quality thresholds: Exploration set: 20 matched-quality scene/seed pairs.Validation set: 8 scenes not included in the matched-quality cohort.Budgets: Q=5, 10, and 20.All selections were frozen before accessing the test set, and all methods were evaluated afterward.
Positive values indicate that Companded has a smaller final delivered size.
| Q | Exploration Set, 20 Pairs: Mean / Median | Wins / Losses / Ties | Validation Set, 8 Pairs: Mean / Median | Wins / Losses / Ties |
|---|---|---|---|---|
| 5 | +1.03% / -1.81% | 8 / 11 / 1 | -1.13% / -4.59% | 1 / 7 / 0 |
| 10 | +2.93% / +2.23% | 12 / 5 / 3 | +0.40% / +0.99% | 4 / 3 / 1 |
| 20 | -36.88% / +3.49% | 14 / 3 / 3 | -93.20% / +3.19% | 5 / 2 / 1 |
Based on the current experiments, consistent improvement requires at least the following conditions to hold simultaneously:
- The candidate-level savings of Companded must be sufficient to cover the additional fallback cost.
- The independent confirmation pass rate must be no worse than that of Uniform, especially without an increase in tail risk.
- The search budget cannot be too small, nor should the search focus only on more aggressive low-bitrate candidates.
In the current implementation, Q=5 underexplores the candidate space. Q=10 is the most suitable operating point on the exploration set, but the validation results remain mixed. Q=20 improves candidate-level performance, yet this improvement does not consistently translate into delivery-level gains. We have not yet identified a budget range that remains consistently stable on the validation set.
W2 + Q2: Does our method work on Gaussian representations from other training pipelines?
Thank you for the suggestion. We added experiments on original 3DGS, Mip-Splatting, Taming 3DGS, and 3DGS-MCMC to test our key designs beyond FastGS. These methods differ in densification, pruning, and training. These differences affect the number of Gaussians and the distributions of SH coefficients, scale, and opacity. Our method quantizes pretrained Gaussian representations and selects compression configurations. It requires neither the FastGS training pipeline nor per-scene fine-tuning. The new experiments directly test whether our designs work with these different attribute distributions.
Configuration selection provides benefits across all four upstream methods. We compare GP/local-mean selection with random selection under the same evaluation budget. Both use SH companded quantization. For the scenes listed in the table, GP/local-mean reduces mean model size by 5.01%–7.44% across the reported groups. The mean PSNR decrease is at most 0.0125 dB in each group. Original 3DGS, specifically requested by the reviewer, achieves size reductions of 6.14%–7.40%. Thus, the benefits of configuration selection extend beyond FastGS.
SH companding also improves the size–quality trade-off on representations from another upstream method. We compare companded and uniform quantization on the four listed NeRF Synthetic scenes trained with 3DGS-MCMC. Both use GP/local-mean configuration selection. Companded quantization reduces mean model size by 4.86% and increases PSNR by 0.1701 dB. It also reduces CVaR10 from 0.775 to 0.576 dB. These results support a key strength of our work: our quantization and configuration selection work with different training pipelines and provide practical compression benefits. We include the detailed results below for ease of review.
Table: Quantization and configuration selection across upstream methods. Bold values indicate improvements over the baseline.
Notes: C denotes SH companded quantization, and UQ denotes uniform quantization. G, R, GP, and Full denote greedy, random, GP/local-mean, and exhaustive configuration selection, respectively. Full does not refer to the complete framework. G, R, and GP each use 9 search evaluations. Full evaluates all 12 candidate configurations.
1. W1: Are the technical contributions only an incremental combination?
We acknowledge that signed-power companding, Gaussian processes, and independent validation all have prior foundations. The technical contribution of this paper is the design of candidate construction and search decisions around the specific interactions in 3DGS compression.
First, the SH quantization design changes the feasible configurations available to the search. We apply companding to the non-DC SH coefficients within spatial blocks and combine it with per-band SH precision settings. This does more than reduce quantization error for a fixed configuration. It also allows some lower-precision configurations to satisfy the quality constraint, which in turn changes the compression setting ultimately selected by the search.
Our initial experiments provide a direct example. For hotdog with seed 19, using the same base model and spatial block size, uniform quantization selected SH band bit widths of 6/5/4, while companding was able to select 4/4/4. Across three seeds in this setting, the average delivered size decreased by about 6.89%, and average PSNR increased by 0.100 dB. This shows that quantization improvements can translate into actual compression gains through configuration selection.
Second, the search is designed around how quality responds to different base models. For each base model, we predict per-view losses separately and then compute mean and tail statistics. We also calibrate the size prediction using measured bitstream sizes for that base model. These predictions only determine which candidate to evaluate next. The final choice must be based on actual encoding, decoding, and rendering measurements. This design allows the search to account for the relationship among base-model differences, quantization error, and actual storage size.
Therefore, our intended contribution is to construct more valuable candidates for low-precision SH compression and to design limited-budget search and delivery rules that make use of them. We do not claim the existing components themselves as new algorithms.