Skip to content
OpenTrain AIFor AI Companies

Instant neural graphics primitives with a multiresolution hash encoding

Thomas Müller, Alex Evans, Christoph Schied, Alexander KellerPublished Jul 1, 2022
DOI Publisher
Researcher verdict
Context only
Use as context only
Benchmark evidence
Missing
Not verified yet
Time to first repro
A few hours
Fast first run
Risk flags
1
Review before use

Abstract

Domain fit: Niche / domain-specific · No strong AI-core implementation/artifact signals were detected from current providers.

Neural graphics primitives, parameterized by fully connected neural networks, can be costly to train and evaluate. We reduce this cost with a versatile new input encoding that permits the use of a smaller network without sacrificing quality, thus significantly reducing the number of floating point and memory access operations: a small neural network is augmented by a multiresolution hash table of trainable feature vectors whose values are optimized through stochastic gradient descent. The multiresolution structure allows the network to disambiguate hash collisions, making for a simple architecture that is trivial to parallelize on modern GPUs. We leverage this parallelism by implementing the whole system using fully-fused CUDA kernels with a focus on minimizing wasted bandwidth and compute operations. We achieve a combined speedup of several orders of magnitude, enabling training of high-quality neural graphics primitives in a matter of seconds, and rendering in tens of milliseconds at a resolution of 1920×1080.

Results and benchmarks

Freshness tier: cold
Neural graphics primitives, parameterized by fully connected neural networks, can be costly to train and evaluate.

Implementation

No direct implementation yet

Maintained implementation evidence is not confirmed for this paper yet.

Use the implementation status and reproduction sections for the current action plan.

Implementation evidence summary
Confidence: low

This is primarily a method paper. Reproduce it within a maintained framework baseline instead of chasing paper-specific repos.

Reproduction risks
  • No maintained paper-verified implementation is currently available

Reproduction readiness

Time to first repro: hours
Last checked: Aug 24, 2026

No repo

No verified implementation available

  • No maintained repository has been identified for this paper. Check adjacent implementations or HF artifacts below.

Hardware requirements

  • We leverage this parallelism by implementing the whole system using fully-fused CUDA kernels with a focus on minimizing wasted bandwidth and compute operations.

Framework baselines

Repositories and ecosystem

No additional verified repositories beyond the primary recommendation.

Hugging Face artifacts

No trustworthy direct or curated related Hugging Face artifacts were found yet. Use targeted searches to quickly locate candidate models, datasets, and demos.

Tip: start with models, then check datasets and spaces if you need evaluation data or demos.

Research context

3,945

Citations

28

References

Tasks

Computer science, Hash function, Speedup, Rendering (computer graphics), Artificial neural network, Hash table, CUDA, Graphics

Methods

Leverage (statistics)

Domains

Artificial intelligence

Evaluation and human feedback data

Open this paper in HFEPX to review benchmark signals, evaluation modes, and human-feedback protocol context.

Open in HFEPX
Explore similar papers