Conversation
added 7 commits
November 24, 2025 16:51
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Gradient-Driven Natural Selection for Compact 3D Gaussian Splatting
Summary
This PR introduces a pruning mechanism based on "Gradient-Driven Natural Selection for Compact 3D Gaussian Splatting" (https://arxiv.org/abs/2511.16980). This new mechanism implements budget-aware pruning to represent scenes with a more compact set of Gaussians. Additionally, this PR removes the MCMC strategy and includes mild code refactoring
Usage
To utilize the pruning mechanism, please enable
enable_natural_selectionand set thefinal_budget. The densification strategy will grow the model to 2.5x thefinal_budgetduring iterations 0–15,000, and then gradually prune it down to thefinal_budgetbetween iterations 15,000 and 23,000Performance Results
This implementation largely follows the original. I was too lazy to generate new tables recently, so please refer to the results in the original paper—there shouldn't be any significant deviation. It is worth noting that I replaced the adaptive adjustment mechanism for opacity regularization weights used in the original implementation, though this shouldn't make a significant difference