Dynamical Implicit Neural Representations
Not on the map. Why?
Abstract (arXiv)
Implicit Neural Representations (INRs) provide a powerful continuous framework for modeling complex visual and geometric signals, but spectral bias remains a fundamental challenge, limiting their ability to capture high-frequency details. Orthogonal to existing remedy strategies, we introduce Dynamical Implicit Neural Representations (DINR), a new INR modeling framework that treats feature evolution as a continuous-time dynamical system rather than a discrete stack of layers. This dynamical formulation mitigates spectral bias by enabling richer, more adaptive frequency representations through continuous feature evolution. Theoretical analysis based on Rademacher complexity and the Neural Tangent Kernel demonstrates that DINR enhances expressivity and improves training dynamics. Moreover, regularizing the complexity of the underlying dynamics provides a principled way to balance expressivity and generalization. Extensive experiments on image representation, field reconstruction, and data compression confirm that DINR delivers more stable convergence, higher signal fidelity, and stronger generalization than conventional static INRs.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 56 of its 73 references that are in the map. First posted on arXiv 26 Nov 2025.
Builds on
56 of 73 references.
References · 56
- 2015Deep Residual Learning for Image Recognitioncited by 51,809
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2018Neural Ordinary Differential Equationscited by 3,733
- 2022Instant Neural Graphics Primitives with a Multiresolution Hash Encodingcited by 3,698
- 2019DeepSDF: Learning Continuous Signed Distance Functions for Shape Representationcited by 2,682
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
- 2020Implicit Neural Representations with Periodic Activation Functionscited by 2,214
- 2020Fourier Features Let Networks Learn High Frequency Functions in Low Dimensional Domainscited by 2,170
- 2018Occupancy Networks: Learning 3D Reconstruction in Function Spacecited by 2,037
- 2018On the Spectral Bias of Neural Networkscited by 1,321
- 2017Spectrally-normalized margin bounds for neural networkscited by 681
- 2018Gradient Descent Provably Optimizes Over-parameterized Neural Networkscited by 655
38 more
- 2017The Implicit Bias of Gradient Descent on Separable Datacited by 649
- 2021Characterizing possible failure modes in physics-informed neural networkscited by 632
- 2017Deep Neural Networks as Gaussian Processescited by 617
- 2018FFJORD: Free-form Continuous Dynamics for Scalable Reversible Generative Modelscited by 584
- 2019On Exact Computation with an Infinitely Wide Neural Netcited by 572
- 2020Learning Continuous Image Representation with Local Implicit Image Functioncited by 550
- 2021Neural Fields in Visual Computing and Beyondcited by 539
- 2018Stronger generalization bounds for deep nets via a compression approachcited by 306
- 2016On the Expressive Power of Deep Neural Networkscited by 302
- 2020Learned Initializations for Optimizing Coordinate-Based Neural Representationscited by 240
- 2020How to train your neural ODE: the world of Jacobian and kinetic regularizationcited by 228
- 2023WIRE: Wavelet Implicit Neural Representationscited by 220
- 2020Spectrum Dependent Learning Curves in Kernel Regression and Wide Neural Networkscited by 200
- 2019Towards Understanding the Spectral Bias of Deep Learningcited by 173
- 2018Understanding Batch Normalizationcited by 157
- 2020Dissecting Neural ODEscited by 150
- 2020OT-Flow: Fast and Accurate Continuous Normalizing Flows via Optimal Transportcited by 143
- 2016A vector-contraction inequality for Rademacher complexitiescited by 141
- 2020Tensor Programs II: Neural Tangent Kernel for Any Architecturecited by 139
- 2021Beyond Periodicity: Towards a Unifying Framework for Activations in Coordinate-MLPscited by 134
- 2018Rademacher Complexity for Adversarially Robust Generalizationcited by 132
- 2020Infinite attention: NNGP and NTK for deep attention networkscited by 117
- 2019Finite Depth and Width Corrections to the Neural Tangent Kernelcited by 114
- 2021A Structured Dictionary Perspective on Implicit Neural Representationscited by 100
- 2019Data-dependent Sample Complexity of Deep Neural Networks via Lipschitz Augmentationcited by 71
- 2023Towards Scalable Neural Representation for Diverse Videoscited by 37
- 2021Learning Quantile Functions without Quantile Crossing for Distribution-free Time Series Forecastingcited by 32
- 2019Potential Flow Generator with L2 Optimal Transport Regularity for Generative Modelscited by 31
- 2023Sequence Length Independent Norm-Based Generalization Bounds for Transformerscited by 28
- 2023Generalization bounds for neural ordinary differential equations and deep residual networkscited by 21
- 2023SuperBench: A Super-Resolution Benchmark Dataset for Scientific Machine Learningcited by 18
- 2024Continuous Field Reconstruction from Sparse Observations with Implicit Neural Networkscited by 18
- 2022Taming Hyperparameter Tuning in Continuous Normalizing Flows Using the JKO Schemecited by 17
- 2022Bounding the Rademacher Complexity of Fourier neural operatorscited by 16
- 2023Regularize implicit neural representation by itselfcited by 13
- 2024From Activation to Initialization: Scaling Insights for Optimizing Neural Fieldscited by 11
- 2024Neural Experts: Mixture of Experts for Implicit Neural Representationscited by 9
- 2024Grounding and Enhancing Grid-based Models for Neural Fieldscited by 8
50 most cited of 56 All 56 (JSON)
Built on by
Not cited yet.