- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper proposes AdaGSFormer, a Gaussian-based framework for camera-based 3D semantic occupancy prediction that adapts its primitive population during feed-forward decoding. Starting from a structured Gaussian initialization, the model predicts per-Gaussian complexity scores supervised by local semantic heterogeneity. Scene-relative thresholds guide learned splitting in complex regions, while contribution-aware pruning and moment-matched merging compress negligible or redundant primitives. The resulting variable-size Gaussian set is decoded through additive optical-density Gaussian-to-voxel aggregation. On the SurroundOcc validation set, the method reports 21.13 mIoU and 31.79 IoU with an average final population of 14.3k Gaussians.
Critical strengths
Good motivation and a coherent approach to local capacity allocation. The framework combines complexity-guided expansion with contribution- and redundancy-aware compression. In particular, low semantic heterogeneity alone does not trigger removal: informative primitives can be retained, while negligible or redundant ones are pruned or merged. This is a sensible design for balancing detailed representation and spatial coverage.
Critical weaknesses
- The paper’s citation style does not conform to the ICLR template.
- The source of the reported efficiency gains is insufficiently characterized.
- Only evaluate on one benchmark.
Questions for authors
Q1: The experiments support the effectiveness of the complete restructuring framework, but do not sufficiently isolate the benefit of complexity-guided selection. In particular, the larger fixed-capacity baseline in Table 2 helps rule out a simple increase in static capacity, whereas the “w/o Split” ablation in Table 3 tests the presence of splitting rather than the criterion used to select primitives for splitting. A comparison against random or shuffled-score selection, with matched per-stage operation counts and otherwise identical settings, would clarify whether the proposed complexity signal improves allocation. This distinction matters because complexity-guided allocation is a central methodological contribution.
Q2: The source of the reported efficiency gains is insufficiently characterized. The headline approximately 2.5× speedup and 57.8% memory reduction are obtained by comparing the complete system against GaussianFormer-2. This comparison also involves differences in initialization and potentially other architectural or implementation choices, so it does not isolate the contribution of adaptive population restructuring. The same-framework comparison in Table 2 is useful and shows approximately 16% lower latency and 10% lower memory than the fixed-16.3k variant. However, a component-wise runtime (for example, gaussian-to-voxel module)and memory breakdown is needed to explain the larger cross-method improvement. Since efficiency is a central motivation and claimed benefit, the current evidence leaves uncertainty about how much of the headline advantage is attributable to the proposed adaptive mechanism.
Q3: Under what scene conditions does the full model produce more or fewer Gaussians than the initial population? Table 6 reports average final counts above the initial 10k for all three complexity groups. Does the full model ever produce fewer than 10k Gaussians? And
Q4: Could you also provide visualizations of representative scenes showing the initial, intermediate, and final Gaussian populations, with splitting, pruning, and merging highlighted and the corresponding counts annotated at each stage?
Q5: Could you evaluate the method on additional occupancy benchmarks to assess its applicability beyond SurroundOcc?
Thank you for the constructive feedback. We address each concern and identify the revisions below.
W1. Citation style.
The revised PDF uses author-year in-text citations throughout.
Revised: in-text citations throughout the manuscript.
W2. Sources of efficiency gains.
We agree that the 2.5x speedup and 57.8% memory reduction versus GaussianFormer-2 include initialization and other system differences. We therefore foreground the same-framework comparison.
Table 1. Efficiency comparison.
Against fixed-16.3k, adaptation gains 0.61 mIoU points with 16.0% lower latency and 10.2% lower memory. Against fixed-10k, it incurs 8.8% extra latency for a 0.93-point gain. These controls establish the measured trade-off within AdaGSFormer; Q2 examines its runtime source.
Revised: Abstract; Sec. 4.2, Table 3.
W3. Evaluation limited to one benchmark.
We added Occ3D-nuScenes and SSCBench-KITTI-360. Q5 provides the results.
Revised: Secs. 4.1-4.2; Appendix A.
Q1. Does complexity-guided selection outperform random selection at matched per-stage counts?
Table 2 compares complexity-guided and uniform-random split-parent selection under the same settings. Random results are mean +/- sample SD over three inference-selection seeds.
Table 2. Split-parent selection comparison.
Guidance improves mIoU by 0.589 and IoU by 1.254 points at the same reported mean final population. This supports the selection criterion beyond simply producing a larger final representation.
Revised: Sec. 4.3, Table 5.
Q2. Component-wise runtime and memory attribution.
Table 3 reports a separate instrumented profile. Population control is included in decoder time.
Table 3. Component runtime (ms).
Control includes complexity/threshold evaluation, splitting, pruning, and merging. Remaining decoder computation falls by 68.125 ms, exceeding the 23.178-ms control cost and yielding a net 44.947-ms decoder saving. G2V time is nearly unchanged, so the measured saving is concentrated in decoder processing. This explains the within-framework runtime benefit. Table 1 reports whole-model memory; module-wise memory attribution is not provided.
Revised: Appendix C.2, Table 11.
Q3. Which scenes produce more or fewer Gaussians, and does any finish below 10k?
Across all validation frames:
Table 4. Final Gaussian-count statistics.
No evaluated frame finishes below 10k. Manuscript Fig. 6 illustrates this variation. The low-count example has a narrow road corridor and few foreground objects; substantial peripheral support is removed, ending at 11,744. The two median examples show a tree-lined road and an open junction, ending at 14,324/14,325: different layouts can require similar total capacity. The maximum-count frame contains vehicles, vegetation, and roadside structures around a junction; continued splitting and limited compression produce 16,918 Gaussians. Cardinality therefore reflects both local refinement demand and compressible support. Intermediate contraction (e.g., 12,153 to 10,988) does occur.
Revised: Appendix D.3, Fig. 6.
Q4. Representative stage-wise visualizations and annotated counts.
Manuscript Fig. 6 shows inputs, initialization, three restructuring stages, final populations, and occupancy GT. Retain/split/prune/merge are distinguished, with counts at each stage. The rows cover a random sample from the lowest-cardinality group, two near-median frames, and the maximum-count frame. Counts satisfy Nout = Nin + S - P - M, where S/P count split/pruned parents and M counts merged pairs, making expansion and compression directly traceable.
Revised: Appendix D.3, Fig. 6.
Q5. Results beyond SurroundOcc.
Table 5. Additional benchmark results.
AdaGSFormer exceeds GaussianFormer-2 by 0.89 and 0.24 points, respectively. Occ3D changes occupancy annotations on nuScenes; monocular SSCBench-KITTI-360 uses independent driving data. These results support applicability across occupancy settings and a separate dataset.
Revised: Sec. 4.2, Table 2; Appendix A, Table 6.