arXiv:2607.02721cs.CVcs.GR2026-07

提出可证明的3D高斯泼溅压缩方法,实现无损渲染质量的极致精简。

Provable Pruning for Efficient 3D Gaussian Splatting via Coresets

论文配图:Provable Pruning for Efficient 3D Gaussian Splatting via Coresets
图 1 · 摘自论文原文
  • 基于敏感度采样构建加权核心集,理论保证压缩后渲染效果
  • 在低分辨率下实现百万级高斯点压缩至千级,保持渲染质量
  • 适合资源受限设备部署,无需大量微调即可高效运行

3D高斯泼溅(3DGS)实现了高质量实时新视角合成,但实际场景常包含数百万个高斯点,压缩对有限硬件部署至关重要。现有压缩方法多为启发式,缺乏渲染目标的乘法近似保证,依赖昂贵的后期微调恢复质量。本文回答核心问题:能否用更小的加权子集(核心集)可证明地替代3DGS场景?首先证明在无限制条件下不存在非平凡的乘法核心集;随后发现乘法保证是可能的,但依赖于渲染分辨率。针对指定分辨率(如代表性视图或视图/光线网格),首次提供3DGS加权核心集构造定理。该方法通过敏感度采样选择高斯点——其重要性评分可证明衡量每个高斯点对全场景目标的贡献。在显式有效性与对数透射稳定性假设下,将目标保证转化为渲染保证。实验表明,本方法在最需要压缩的场景表现最优:极强压缩且无需或仅需极短微调,达到当前最佳性能。代码开源:https://github.com/waseem-m/3dgs_provable_coresets。

原文摘要 · Abstract (English)

3D Gaussian Splatting (3DGS) enables high-quality real-time novel-view synthesis, but practical scenes often contain millions of Gaussians, making compression essential for deployment on limited hardware. Existing reduction methods are effective but mostly heuristic: they provide no multiplicative approximation guarantee for the rendered objective, and thus rely heavily on costly post-pruning finetuning to recover quality. We ask a basic question: can a 3DGS scene be provably replaced by a much smaller weighted subset (coreset) while preserving the objective of interest? We first show that, in the unrestricted setting, no non-trivial multiplicative 3DGS coreset exists. We then show that multiplicative guarantees are not impossible, but resolution-dependent. For a prescribed rendering resolution, such as representative views or grids of views/rays, we provide the first weighted coreset construction theorem for 3DGS. The construction samples Gaussians by sensitivity: provable importance scores measuring each Gaussian's role in the full-scene objective. Finally, under explicit validity and log-transmittance stability assumptions, we turn this objective guarantee into a rendering guarantee. Empirically, our method is strongest where deployment needs it most: aggressive compression with no or minimal recovery compute. In prune-only and very short finetuning regimes, it achieves state-of-the-art performance, showing that principled importance estimation can be both theoretically meaningful and practically useful. Open-source code is available at https://github.com/waseem-m/3dgs_provable_coresets.

3D生成模型压缩核心集高斯泼溅

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。