SearcharxivSearch

arXiv · 2608.13044

Identifiability-aware neural ordinary differential equations for parsimonious and reliable dynamic modelling

Abstract

Neural ordinary differential equations (NODE) and hybrid NODE models provide flexible continuous-time representations of complex dynamic systems, but their expressive capacity can exceed the information content of the available data. Consequently, these models may reproduce observed trajectories while retaining weakly identifiable parameters, poorly constrained neural components, and unreliable extrapolation. Here we introduce identifiability-aware neural ordinary differential equations (iNODE), a framework that incorporates practical identifiability into neural differential equation design. iNODE models embed neural components as explicit analytic functions within the governing equations, enabling direct sensitivity analysis, Fisher-information-based confidence intervals, and identifiability-aware architecture selection. Candidate architectures are generated under data-support constraints, jointly calibrated, and ranked according to predictive accuracy, parsimony, and parameter identifiability. We evaluate the complete iNODE workflow against conventional NODE and hybrid NODE workflows representative of current practice using four controlled ground-truth benchmarks spanning fully data-driven and hybrid formulations, latent time-varying parameters, partial observability, and sparse or noisy measurements. Using the same training data and evaluation scenarios, the iNODE workflow selected more compact architectures, reduced parameter uncertainty, and improved extrapolation and recovery from latent-dynamics. These results establish practical identifiability as a model-design principle for parsimonious and reliable neural differential equations.

Explore related subjects

Keep this discovery

BibTeXRIS

Núria Campo-Manzanares, Eva Balsa-Canto. 2026-08-13. Identifiability-aware neural ordinary differential equations for parsimonious and reliable dynamic modelling. https://arxiv.org/abs/2608.13044

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Admissible Fourier Lengths, KAM Reducibility, and Spectral Applications

We develop a perturbative KAM reducibility theory for one-frequency $\mathrm{SL}(2,\mathbb{R})$ cocycles based on an admissible Fourier length $\ell$. The regularity relevant to the iteration is measured by positive adapted Fourier width rather than ordinary smoothness in the Euclidean length $|n|$. The same length governs Fourier decay, truncation and resonance scales, and the arithmetic condition controlling the small divisors. This framework contains the classical analytic and Gevrey settings, while non-monotone choices of $\ell$ allow classical nowhere differentiable Weierstrass-type perturbations and continuous perturbations outside every positive H\"older class. As spectral applications, we obtain purely absolutely continuous spectrum for every phase and $1/2$-H\"older continuity of the integrated density of states for the associated quasiperiodic Schr\"odinger operators. The Aubry dual has pure point spectrum for Lebesgue almost every dual phase, with eigenfunctions exponentially localized in the metric induced by $\ell$. We also construct nowhere differentiable quasiperiodic potentials with purely absolutely continuous Cantor spectrum.

math.DS

Dynamics inside the attracting basins of some skew products

Polynomial skew products in $\mathbb{C}^2$ are maps of the form $F(z,w)=(P(z),Q(z,w))$, where $P$ and $Q$ are polynomials. Their local dynamics have been widely investigated. In this paper, we study the global dynamics inside Fatou components of some skew products. We consider all the inverse images in a Fatou component of a given point and use the Kobayashi metric to measure the distance between points. In the cases we consider, there are always arbitrarily large Kobayashi balls in the complement of these inverse sets.

math.DS

Ergodicity of dynamical systems without uniqueness of orbits

Recently, there has been considerable interest in the study of non-deterministic dynamical systems. To analyze the chaotic behavior of such systems from a measure-theoretic viewpoint, it is desirable to consider ergodicity. However, the classical definition of ergodicity involves invariant sets, whose definition is not unique for non-deterministic dynamical systems. Thus, we are led to the question of which invariance yields an interesting definition of ergodicity. Here, we propose a definition based on the strong backward invariance and show that analogs of classical results hold. We also consider implications of the Birkhoff ergodic theorem for systems without uniqueness of orbits.

math.DS