Shortening the Ray: Accelerating 3D Gaussian Splatting via Concentrated Primitives
Speeding Up the Learning of 3D Gaussians with Much Shorter Gaussian Lists
The paper introduces a highly efficient training method for 3D Gaussian Splatting (3DGS) that significantly accelerates learning by shortening the "Gaussian list" processed per pixel. By combining a periodic scale reset strategy with an entropy-based alpha-blending constraint, the method achieves state-of-the-art training speeds (e.g., under 100s for Mip-NeRF 360) while maintaining competitive rendering quality.
TL;DR
Training 3D Gaussian Splatting (3DGS) usually takes minutes to hours because each pixel "sees" too many Gaussians. This paper introduces a method to shrink the list of Gaussians per pixel by forcing Gaussians to be smaller (Scale Reset) and more decisive (Entropy loss). The result? Training Mip-NeRF 360 scenes in under 100 seconds with almost no loss in quality.
Academic Position: This work moves beyond simple "pruning" or "optimizer tuning" and targets the core computational bottleneck of the rasterization pipeline—Gaussian overlap.
The Bottleneck: Overlapping "Blurred" Lists
In 3DGS, rendering a pixel involves sorting and blending all Gaussians that overlap with that pixel's coordinate. If Gaussians are large and low-opacity, a single pixel might have hundreds of Gaussians in its "list," leading to massive memory access and computation during both forward and backward passes.
The authors observed that most of these Gaussians contribute negligible weights. The "Long Tail" of the Gaussian list is where efficiency goes to die.
Methodology: The "Concentration" Strategy
The authors solve this through two elegant interventions:
1. Periodic Scale Reset
Instead of complex volume regularization, the authors simply reset the scale of all Gaussians every few epochs using a shrinking factor .
- Intuition: By force-shrinking Gaussians, the model is forced to increase the opacity () of the remaining Gaussians to compensate and match the training images. Smaller, more opaque Gaussians naturally cover fewer pixels, immediately shortening the per-pixel lists.
2. Alpha-Blending Entropy Constraint
This is the mathematical heart of the paper. They introduce an entropy loss on the blending weights along a ray.
- The Math: Since , these weights form a probability distribution. Minimizing entropy () pushes the distribution toward a "one-hot" state.
- The Result: In each pixel's list, a few Gaussians become "dominant" (high weight) while others are pushed toward zero. This "polarization" allows the rasterizer to skip or ignore the non-dominant Gaussians much earlier.
Fig 1: By forcing Gaussians to be more localized (c) and weights to be more polarized (f), the Gaussian list length significantly decreases (b).
Experiments: Sub-Minute Training
The performance gains are most visible when looking at the trade-off curves. The proposed method (often integrated with the LiteGS backbone) sits at the top-left of the Efficiency vs. Quality graph.
Fig 2: Comparison showing the proposed method achieves the fastest training time while maintaining a high PSNR (~27dB).
Key Stats:
- Time: Mip-NeRF 360 training cut from 919s to 99s.
- Inference: Rendering speed increased from 140 FPS to 343 FPS due to the sparse, concentrated nature of the resulting Gaussians.
- Robustness: The method works even with a small "compact" number of Gaussians (0.6M), outperforming specialized compression methods like Mini-Splatting2.
Critical Analysis & Conclusion
The Takeaway: This research proves that you don't need fewer Gaussians to be fast; you need more focused Gaussians. By shortening the list of active primitives per pixel, the authors have optimized 3DGS at the architectural level.
Limitations:
- The Scale Reset is a "hard" intervention. If the shrinking factor is too aggressive, the model might lose track of complex geometry that requires larger, smoother Gaussians for interpolation.
- There is a slight drop in PSNR (~0.2-0.4 dB) in exchange for the 9x speedup, which might matter for high-end archival applications but is negligible for real-time robotics.
Future Outlook: Integrating this "Concentrator" approach with generative priors could allow for instantaneous scene reconstruction from just a few images, as the optimization landscape becomes much "sharper" and easier to navigate.
Fig 3: Visualization of the resulting Gaussians—notice how the proposed method produces much tighter, more distinct primitives compared to the "fuzzy" clouds of standard 3DGS.
