Search arXivSearch

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

Explore connections, maps & timelines

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

Effective equidistribution of orbits under semisimple groups on congruence quotients

We prove an effective equidistribution result for periodic orbits of semisimple groups on congruence quotients of an ambient semisimple group.This extends a previous work of Einsiedler, Margulis and Venkatesh. The main new feature is that we allow for periodic orbits of semisimple groups with nontrivial centralizer in the ambient group. Our proof uses crucially an effective closing lemma from work of the author with Lindenstrauss, Margulis,Mohammadi, and Shah.

math.DS

Generalized entropy of measure-induced maps

A classical result by E. Glasner and B. Weiss states that the topological entropy of a map $f$ is zero if and only if the topological entropy of its measure-induced map $f_*$ is zero, where $f_*$ is defined as the push-forward of a measure. In this work, we use generalized entropy to distinguish the complexity of these maps and prove that the measure-induced map is much more complex than the original map. Moreover, we introduce the generalized mean dimension, an invariant that is useful for distinguishing dynamical systems with zero mean dimension, including those with the small-boundary property, and we show a relationship between this new invariant and generalized entropy.

math.DS

The endpoint problem for $\varepsilon$-hypercyclicity

For a fixed $0<\varepsilon<1$, F. Bayart asked in 2024 whether there exists an operator $T$ such that, for every $0<δ<1$, $T$ is $δ$-hypercyclic if and only if $δ\in[\varepsilon,1)$. We answer this question affirmatively by constructing a weighted backward shift on $\ell_2(\mathbb N_0,\ell_2(\mathbb N_0))$ with this property.

math.DS