REVIEW 4 cited by
ODEFormer: Symbolic Regression of Dynamical Systems with Transformers
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We introduce ODEFormer, the first transformer able to infer multidimensional ordinary differential equation (ODE) systems in symbolic form from the observation of a single solution trajectory. We perform extensive evaluations on two datasets: (i) the existing "Strogatz" dataset featuring two-dimensional systems; (ii) ODEBench, a collection of one- to four-dimensional systems that we carefully curated from the literature to provide a more holistic benchmark. ODEFormer consistently outperforms existing methods while displaying substantially improved robustness to noisy and irregularly sampled observations, as well as faster inference. We release our code, model and benchmark dataset publicly.
Forward citations
Cited by 4 Pith papers
-
Neuro-Symbolic ODE Discovery with Latent Grammar Flow
Latent Grammar Flow embeds grammar-based ODE representations into a discrete latent space with a behavioural loss and samples candidate equations via discrete flow to fit observed data.
-
Neural operator discovery from heterogeneous trajectories
Trajectory grouping plus a low-dimensional latent bottleneck lets a neural operator discover each system's hidden governing factors and extrapolate to unseen systems.
-
Modelling Chemical Reaction Networks using Neural Ordinary Differential Equations
A neural ODE correction to mass-action kinetics improved predicted oscillation periods when transferred to new settings, but did not improve classifying sustained versus damped oscillations.
-
Drag modelling for flows through assemblies of spherical particles with machine learning: A comparison of approaches
Applying genetic programming to outputs of a graph neural network yields compact symbolic drag-variation formulas at Reynolds numbers up to 280, though with lower accuracy than the network.
Discussion (0). Continue with ORCID to comment.