Skip to content
NewA calmer, faster ZeroHour

RLSplat makes feed-forward Gaussian splatting scale with the budget

Original title: RLSplat: Resource-Linear Budget Control for Feed-forward 3D Gaussian Splatting

Hugging Face daily papersby Injae Kim, Minseok Joo, Jihwan Park ()1 min read1 · 1 read
AI summary · x-ai/grok-4.7Summaries by Vani AI

Latency and peak memory fall with the Gaussian budget, unlike prune-after-dense methods that stay nearly constant.

RLSplat is a budget-controllable feed-forward 3D Gaussian Splatting method whose representation size, inference latency, and peak memory decrease linearly as the Gaussian budget shrinks. It allocates the exact requested count across local scene regions instead of predicting a dense set and then pruning it. Decoding attends only to nearby Gaussians found by hierarchical neighbor search. In zero-shot tests the authors say it beats prior budget-controllable methods at every budget.

Key facts
  • It surpasses the strongest baseline with 4 times fewer Gaussians.
  • At low budgets it runs up to 4.1 times faster.
  • Peak memory is up to 9.6 times lower at low budgets.
  • Each Gaussian attends only to nearby Gaussians during decoding.
Explain this AI news with Vani AIWhat was announced, what is new and why it matters, in a new chat

From the original article

1 min read at huggingface.co

Feed-forward 3D Gaussian Splatting (FF3DGS) reconstructs 3D scenes from images in a single forward pass, making it well-suited to applications that must operate within limited resource budgets. To further improve its practicality, recent budget-controllable FF3DGS methods allow the number of Gaussians to be adjusted at inference, so that the output meets a given storage limit or rendering-latency constraint.

Hugging Face daily papers

By Injae Kim, Minseok Joo, Jihwan Park · huggingface.co

Read the full article at Hugging Face daily papers

A short excerpt; the article and its images belong to the publisher. Summary, key facts and assessment above are AI-written from the article and can be wrong.