Refine Now, Query Fast: A Decoupled Refinement Paradigm for Implicit Neural Fields
Tianyu Xiong, Skylar Wurster, Han-Wei Shen

TL;DR
This paper introduces the Decoupled Representation Refinement (DRR) paradigm for implicit neural fields, achieving high fidelity and faster inference by decoupling complex neural networks from the inference process, validated by state-of-the-art results.
Contribution
The paper proposes a novel DRR architectural paradigm that separates high-capacity neural refinement from fast inference, enabling efficient and accurate implicit neural representations.
Findings
Achieves up to 27× faster inference than high-fidelity baselines.
Demonstrates state-of-the-art fidelity on ensemble simulation datasets.
Introduces the DRR-Net and Variational Pairs data augmentation strategy.
Abstract
Implicit Neural Representations (INRs) have emerged as promising surrogates for large 3D scientific simulations due to their ability to continuously model spatial and conditional fields, yet they face a critical fidelity-speed dilemma: deep MLPs suffer from high inference cost, while efficient embedding-based models lack sufficient expressiveness. To resolve this, we propose the Decoupled Representation Refinement (DRR) architectural paradigm. DRR leverages a deep refiner network, alongside non-parametric transformations, in a one-time offline process to encode rich representations into a compact and efficient embedding structure. This approach decouples slow neural networks with high representational capacity from the fast inference path. We introduce DRR-Net, a simple network that validates this paradigm, and a novel data augmentation strategy, Variational Pairs (VP) for improving…
Peer Reviews
Decision·ICLR 2026 Poster
1) DRR-Net hits a strong pareto point as it produces competitive results compared to baselines like FA-INR in PSNR/SSIM on large 3D scientific ensembles, but delivers ~10x-30x faster inference, and it outperforms fast baselines like Explorable-INR in fidelity while staying in their runtime class. 2) Instead of treating each simulation parameter independently or relying on low-rank factorization, DRR-Net builds unified multi-parameter conditional embeddings and refines them jointly, so nonlinear
1) The stated one time cheap evaluation of refiner R seems to be dependent on the problem setup, boundaries etc. does that mean if the boundaries have changed a new refiner is required? If yes this seems like a major drawback compared to other methods especially given that training times for this method are relatively longer than most other frameworks. Can the authors clarify whether it is correct, that any specific change in the domain (boundaries etc.) requires retraining? Furthermore is there
- The method is well motivated and an effective compromise between fast embedding-based models and MLP-based approaches. - The paper is well written - Detailed experiments on three scientific datasets show quality vs. training/inference speed tradeoff. DRR-Net compares favorably. - Easy to implement data augmentation method that improves PSNR/SSIM in most cases - Additional experiments on vision/graphics tasks in the appendix
- The paper is generally well written, but the description of the condition encoder was a bit unclear to me. How does "a set of 1D multi-resolution feature lines for each simulation parameter" support scalability to "arbitrary parameter dimensions" Could you please clarify this? - Previous approaches have considered higher resolution scientific datasets, e.g., [1]. Can DRR-Net scale to similar resolutions; what changes are necessary? - The proposed data augmentations seem effective for interpola
## Soundness The experiments support the central idea of the method, i.e., good reconstruction quality and fast inference. ## Contribution Achieving fast inference times with NFs is a known problem, and the authors offer an interesting solution that combines a learning-based approach with the advantages of multi-resolution representations, which have shown good results in neural graphics processing. ## General - Very interesting take on a known problem of NFs: Large MLPs are slow in inference.
My main issue with the paper is that it lacks clarity about the method. Furthermore, the reported metrics are insufficient for physical simulations. Certain claims regarding “SOTA” also do not stand up to scrutiny.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGenerative Adversarial Networks and Image Synthesis · Model Reduction and Neural Networks · 3D Shape Modeling and Analysis
