Ordinary differential equations (ODEs) are a widely used formalism for the mathematical modeling of dynamical systems, a task omnipresent in scientific domains. The paper introduces a novel method for inferring ODEs from data, which extends ProGED, a method for equation discovery that allows users to formalize domain-specific knowledge as probabilistic context-free grammars and use it for constraining the space of candidate equations. The extended method can discover ODEs from partial observations of dynamical systems, where only a subset of state variables can be observed. To evaluate the performance of the newly proposed method, we perform a systematic empirical comparison with alternative state-of-the-art methods for equation discovery and system identification from complete and partial observations. The comparison uses Dynobench, a set of ten dynamical systems that extends the standard Strogatz benchmark. We compare the ability of the considered methods to reconstruct the known ODEs from synthetic data simulated at different temporal resolutions. We also consider data with different levels of noise, i.e., signal-to-noise ratios. The improved ProGED compares favourably to state-of-the-art methods for inferring ODEs from data regarding reconstruction abilities and robustness to data coarseness, noise, and completeness.
Equation discovery, also known as symbolic regression, is the field of machine learning that studies algorithms for discovering quantitative laws, expressed as closed-form equations or formulas, in collections of observed data. The latter is expected to come from measurements of physical systems and, therefore, noisy, moving the focus of equation discovery algorithms towards discovering approximate equations. These loosely match the noisy observed data, rendering them inappropriate for applications in mathematics. In this article, we introduce Diofantos, an algorithm for discovering equations in the ring of integers that exactly match the training data. Diofantos is based on a reformulation of the equation discovery task into the task of solving linear Diophantine equations. We empirically evaluate the performance of Diofantos on reconstructing known equations for more than 27,000 sequences from the online encyclopedia of integer sequences, OEIS. Diofantos successfully reconstructs more than 90% of these equations and clearly outperforms SINDy, a state-of-the-art method for discovering approximate equations, that achieves a reconstruction rate of less than 70%.
We study the problem of exact equation discovery, i.e., identifying symbolic equations that perfectly describe relationships in noise-free data. While most existing approaches focus on approximate recovery from noisy measurements, we consider settings in which exact correctness is required. This setting is closely related to methods that infer symbolic relations, such as recurrence equations or generating functions, from finite data. We show that exact equation discovery can be formulated as the computation of the vanishing ideal of the observed data and leverage Gröbner bases as an effective algorithmic tool. Building on this connection, we introduce MoadeeB, a new algorithm for discovering exact equations over integers and rational numbers. We evaluate MoadeeB in a large-scale empirical study on more than 30,000 integer sequences from the Online Encyclopedia of Integer Sequences (OEIS), focusing on the reconstruction of known recurrences and the discovery of previously undocumented ones. We compare against state-of-the-art symbolic regression and program synthesis approaches, as well as approaches from experimental mathematics and computer algebra that infer symbolic relations directly from finite sequence prefixes. The results show that MoadeeB achieves competitive or superior performance across these method classes, while additionally enabling the discovery of exact equations beyond the scope of existing approaches.