Lightweight Predictive 3D Gaussian Splats
Junli Cao, Vidit Goel, Chaoyang Wang, Anil Kag, Ju Hu, Sergei Korolev,, Chenfanfu Jiang, Sergey Tulyakov, Jian Ren

TL;DR
This paper introduces a compact 3D Gaussian splat representation that significantly reduces storage requirements while maintaining or improving rendering quality, enabling real-time rendering on mobile devices.
Contribution
A novel representation method that shares attributes among nearby points and predicts discarded points with tiny MLPs, reducing storage without sacrificing quality.
Findings
Achieves high-quality rendering with much less storage.
Enables real-time rendering on mobile devices.
Outperforms existing compact solutions in quality and efficiency.
Abstract
Recent approaches representing 3D objects and scenes using Gaussian splats show increased rendering speed across a variety of platforms and devices. While rendering such representations is indeed extremely efficient, storing and transmitting them is often prohibitively expensive. To represent large-scale scenes, one often needs to store millions of 3D Gaussians, occupying gigabytes of disk space. This poses a very practical limitation, prohibiting widespread adoption.Several solutions have been proposed to strike a balance between disk size and rendering quality, noticeably reducing the visual quality. In this work, we propose a new representation that dramatically reduces the hard drive footprint while featuring similar or improved quality when compared to the standard 3D Gaussian splats. When compared to other compact solutions, ours offers higher quality renderings with significantly…
Peer Reviews
Decision·ICLR 2025 Poster
- The proposed tree structure enables parent nodes to represent children nodes using an on-the-fly decoding pipeline. This results in the small disk usage of this representation with high rendering quality. - The optimization schemes, ATM for growth and warm-up for initial training, lead to achieving stable and effective optimization of the proposed representation.
- The main weakness of this paper is the limited technical novelty. The proposed tree structure mainly comes from the anchor-based representation, Scaffold-GS [1]. Also, the adaptive manipulation of children nodes is proposed in HAC [2], with more efficient learnable masks. Moreover, the usage of a hash grid for efficient 3DGS representation is also proposed in HAC and CompactGS [3]. - Also, it demonstrates a slower rendering speed compared to 3DGS, as we can see in L458. It indicates that thi
The idea of deriving the positions of child splats and associated attributes – position, color, scale, etc. – from the parent using a small neural network and only storing parent splats together with the weights of the neural network is new and should definitely be published. The paper gives a very nice introduction to the problem and a very good overview of the existing approaches. The method itself is explained in detail and is easy to follow. Comprehensive ablation studies show the influence
Unfortunately, there is no code to go with the paper, so that the procedure can be tested independently.
Storage-effective representation for 3D gaussians. The proposed method shown to outperform existing SOTA methods. The proposed method shown to run on mobile devices. Ablation study to show necessities of the proposed components.
There is only one figure (i.e., fig.2) for explaining the proposed method. Thus, it may not be easy to follow the process of the method.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topics3D Shape Modeling and Analysis · Textile materials and evaluations
MethodsSPEED: Separable Pyramidal Pooling EncodEr-Decoder for Real-Time Monocular Depth Estimation on Low-Resource Settings
