Symbolic Neural ODEs: Learning interpretable models from time-series data

What the math gives to ML

The paper provides two transferable constructions beyond an ordinary neural ODE: explicit Runge–Kutta composition trained over recursively generated trajectories, and a compositional symbolic network whose primitives are linear combinations and learnable products of powers. The important asset is not merely interpretability; multi-step composition directly trains the map that will be used at inference time, while sparsity can compress the resulting vector field into a small set of terms. A practical transfer is to use horizon curricula and rollout-consistency losses for learned dynamics modules, and to use the symbolic primitive network as a sparse replacement for an MLP when the target dynamics are low-dimensional or structured.