- Rating
- 1
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper proposes Decision-FLIP, a structured pruning method for occupancy predictors that keep a persistent bank of Gaussians or learned queries. Each bank row is scored by how many voxel argmax decisions change when its contribution is removed from the (additive) readout, using unlabeled calibration frames. For streaming models like GaussianWorld, the score follows each row through warp, death and refill. The number of survivors is chosen by Otsu thresholding on log scores, with a separation gate that keeps the full bank if the split looks weak. The selected rows are then physically removed from all aligned tensors, producing a smaller checkpoint that loads strictly.
Experiments cover GaussianWorld, GaussianFormer-1 and GaussianFormer3D on SurroundOcc, a self-trained GaussianFlowOcc on Occ3D, and OccFormer on SemanticKITTI as a query-bank transfer. GaussTR serves as a negative control. Reported results:
- 12–79% of eligible rows removed;
- 7–45% lower bank-dependent latency and 2.4–8.0% lower whole-model latency;
- semantic changes within about 0.18 point after one matched recovery epoch.
Critical strengths
1. The criterion is simple, exact and label-free, and the controls are careful. Counting actual argmax flips under an exact readout deletion ties importance directly to the output that matters. The paper supports it with matched full-vs-compiled recovery, same-K ranking controls, strict-load compilation, and an informative negative control: on GaussTR the gate passes, but the ranking is no better than random, because rows have no stable identity. I appreciated that this failure is reported rather than left out.
2. The reduction is physical and the reporting is transparent. Rows are actually removed from every aligned tensor, so latency and memory numbers come from smaller real checkpoints rather than masks. Component-level timing, peak memory and per-class results are all there, and the limitations (Amdahl bounds, the row-identity requirement) are stated openly.
Critical weaknesses
(1) The practical gain is small, and it's hard to attribute it to the proposed score. End to end, the primary endpoints save 2.4–8.0% latency. Peak memory goes down on some models but is flat or slightly up on others (GaussianFormer-1 +0.8%). Amdahl's law explains this, but it leaves a fairly thin deployment case.
More importantly, outside OccFormer, the flip score barely beats the cheap proxies a practitioner would try first:
- GaussianFormer-1, before recovery: opacity loses 0.183 mIoU vs. 0.157 for the flip score. After recovery at , the two are essentially identical (19.105 vs. 19.108).
- GaussianWorld: opacity −0.244 vs. −0.179.
- GaussianFormer3D: magnitude −0.071 vs. −0.044.
Gaps of a few hundredths of a point don't convince me that the decision-level score is worth its extra complexity over opacity. The budget selection (Otsu with a gate) is a standard tool, and the paper itself presents it as Pareto-competitive rather than better than GMM or Kneedle. So I'm not sure what a practitioner gains over a simple opacity cut.
(2) The scope is narrow, and the headline accuracy claim depends on a recovery step that can hide differences. The method needs persistent rows with stable identity and an exactly decomposable additive readout. That rules out models like GaussTR and essentially limits it to a small family of Gaussian/query-bank occupancy models, which makes the broader impact for ICLR feel limited.
The "within 0.18 point after matched recovery" claim also mixes quite different situations:
- On OccFormer, the recovery epoch makes both arms worse (full 13.50 → 12.99, compiled 13.34 → 13.02), so "+0.03 after recovery" compares two models that are both below the released checkpoint.
- On GaussianFormer-1 and GaussianFormer3D, the same epoch moves absolute mIoU by +1.7 and +2.7 through pipeline adaptation, which is far larger than the compilation cost being measured.
In these cases, the post-recovery deltas don't add much beyond the zero-recovery numbers.
Questions for authors
1. Would Otsu on opacity scores do about as well? Since opacity is close to the flip score on GaussianWorld and GaussianFormer-1, could you apply the same guarded Otsu rule to opacity (or magnitude) scores and report the selected K and accuracy before and after recovery? That would show whether the benefit comes from the decision-level score or from the budget-free selection rule.
2. Which checkpoints are you starting from? GaussianWorld is compiled from an "opacity-calibrated" source checkpoint (21.902 mIoU) rather than the released one (21.759). What exactly is calibrated, and does the same step help the full model on its own? For OccFormer, given that the recovery epoch hurts both arms, would you consider making the zero-recovery comparison the primary result?
3. Are the bank-dependent latency numbers measured the same way across models? For GaussianWorld and GaussianFormer-1, Table 1 seems to report the Gaussian-side subtotal (encoder plus head). For GaussianFormer3D, the −13.2% appears to cover the encoder only. Including the head would give roughly −9.7%. Could you make the definition consistent across rows?