Neuro-Symbolic ODE Discovery with Latent Grammar Flow
About
Understanding natural and engineered systems often relies on symbolic formulations, such as differential equations, which provide interpretability and transferability beyond black-box models. We introduce Latent Grammar Flow (LGF), a neuro-symbolic generative framework for discovering ordinary differential equations from data. LGF embeds equations as grammar-based representations into a discrete latent space and forces semantically similar equations to be positioned closer together with a behavioural loss. Then, a discrete flow model guides the sampling process to recursively generate candidate equations that best fit the observed data. Domain knowledge and constraints, such as stability, can be either embedded into the rules or used as conditional predictors.
Related benchmarks
| Task | Dataset | Result | Rank | |
|---|---|---|---|---|
| ODE discovery | ODEBench Benchmark 1 | Mean Relative L2 Error (State Variable)0.117 | 5 | |
| ODE discovery | Benchmark 2 | Model Complexity27.9 | 5 | |
| Symbolic ODE discovery | Duffing oscillator Benchmark 3 | Mean Relative L2 Error ($u_t$)0.109 | 4 | |
| Symbolic ODE discovery | Pendulum Benchmark 3 | Mean Relative L2 Error ($u_t$)0.015 | 2 | |
| Symbolic ODE discovery | Van der Pol oscillator Benchmark 3 | Mean Relative L2 Error (u_t)0.115 | 2 | |
| Symbolic ODE discovery | Exponential stiffness Benchmark 3 | Mean Relative L2 Error (u_t)0.171 | 2 | |
| Symbolic ODE discovery | Nonlinear damping Benchmark 3 2 | Mean Relative L2 Error ($u_t$)0.029 | 2 | |
| Symbolic ODE discovery | Nonlinear damping 1 Benchmark 3 | Mean Relative L2 Error (u_t)0.264 | 2 |