Symbolic Discovery of Stochastic Differential Equations with Genetic Programming

• URL: http://arxiv.org/abs/2603.09597v1
• Date: Tue, 10 Mar 2026 12:43:02 GMT
• Title: Symbolic Discovery of Stochastic Differential Equations with Genetic Programming
• Abstract summary: We introduce a method for symbolic discovery of differential equations based on genetic programming.<n>Our results demonstrate accurate recovery of governing equations and efficient scaling to higher-dimensional systems.<n>This work extends symbolic regression toward interpretable discovery of dynamical systems.
• Score: 1.0582941427792738
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Automated scientific discovery aims to improve scientific understanding through machine learning. A central approach in this field is symbolic regression, which uses genetic programming or sparse regression to learn interpretable mathematical expressions to explain observed data. Conventionally, the focus of symbolic regression is on identifying ordinary differential equations. The general view is that noise only complicates the recovery of deterministic dynamics. However, explicitly learning a symbolic function of the noise component in stochastic differential equations enhances modelling capacity, increases knowledge gain and enables generative sampling. We introduce a method for symbolic discovery of stochastic differential equations based on genetic programming, jointly optimizing drift and diffusion functions via the maximum likelihood estimate. Our results demonstrate accurate recovery of governing equations, efficient scaling to higher-dimensional systems, robustness to sparsely sampled problems and generalization to stochastic partial differential equations. This work extends symbolic regression toward interpretable discovery of stochastic dynamical systems, contributing to the automation of science in a noisy and dynamic world.

Related papers

• Discovering Mathematical Equations with Diffusion Language Model [6.384075523245284]
  We introduce DiffuSR, a pre-training framework for symbolic regression built upon a continuous-state diffusion language model.<n>DrouSR employs a trainable embedding layer within the diffusion process to map discrete mathematical symbols into a continuous latent space.<n>We also design an effective inference strategy to enhance the accuracy of the diffusion-based equation generator.
  arXiv  Detail & Related papers  (2025-09-16T14:53:44Z)
• Discovering equations from data: symbolic regression in dynamical systems [0.0]
  In this paper, five symbolic regression methods were used for recovering equations from nine dynamical processes, including chaotic dynamics and epidemic models.<n> Benchmark results demonstrate its high predictive power and accuracy, with some estimates being indistinguishable from the original analytical forms.<n>These results highlight the potential of symbolic regression as a robust tool for inferring and modelling real-world phenomena.
  arXiv  Detail & Related papers  (2025-08-27T20:30:09Z)
• Sparse identification of quasipotentials via a combined data-driven method [8.508437491732954]
  We show how to discover parsimonious equations for the quasipotential directly from data.<n>We use a neural network and a sparse regression algorithm, specifically designed to symbolically describe multistable energy landscapes.<n>Our model-unbiased analytical forms of the quasipotential is of interest to a wide range of applications aimed at assessing metastability and energy landscapes.
  arXiv  Detail & Related papers  (2024-07-06T11:27:52Z)
• Deep Generative Symbolic Regression [83.04219479605801]
  Symbolic regression aims to discover concise closed-form mathematical equations from data. Existing methods, ranging from search to reinforcement learning, fail to scale with the number of input variables. We propose an instantiation of our framework, Deep Generative Symbolic Regression.
  arXiv  Detail & Related papers  (2023-12-30T17:05:31Z)
• Learning minimal representations of stochastic processes with variational autoencoders [52.99137594502433]
  We introduce an unsupervised machine learning approach to determine the minimal set of parameters required to describe a process. Our approach enables for the autonomous discovery of unknown parameters describing processes.
  arXiv  Detail & Related papers  (2023-07-21T14:25:06Z)
• Genetic Programming Based Symbolic Regression for Analytical Solutions to Differential Equations [8.669375104787806]
  We present a machine learning method for the discovery of analytic solutions to differential equations. We demonstrate the ability to recover true analytic solutions, as opposed to a numerical approximation.
  arXiv  Detail & Related papers  (2023-02-07T00:23:07Z)
• Symbolic Recovery of Differential Equations: The Identifiability Problem [52.158782751264205]
  Symbolic recovery of differential equations is the ambitious attempt at automating the derivation of governing equations. We provide both necessary and sufficient conditions for a function to uniquely determine the corresponding differential equation. We then use our results to devise numerical algorithms aiming to determine whether a function solves a differential equation uniquely.
  arXiv  Detail & Related papers  (2022-10-15T17:32:49Z)
• Neural Symbolic Regression that Scales [58.45115548924735]
  We introduce the first symbolic regression method that leverages large scale pre-training. We procedurally generate an unbounded set of equations, and simultaneously pre-train a Transformer to predict the symbolic equation from a corresponding set of input-output-pairs.
  arXiv  Detail & Related papers  (2021-06-11T14:35:22Z)
• Discovery of Nonlinear Dynamical Systems using a Runge-Kutta Inspired Dictionary-based Sparse Regression Approach [9.36739413306697]
  We blend machine learning and dictionary-based learning with numerical analysis tools to discover governing differential equations. We obtain interpretable and parsimonious models which are prone to generalize better beyond the sampling regime. We discuss its extension to governing equations, containing rational nonlinearities that typically appear in biological networks.
  arXiv  Detail & Related papers  (2021-05-11T08:46:51Z)
• The data-driven physical-based equations discovery using evolutionary approach [77.34726150561087]
  We describe the algorithm for the mathematical equations discovery from the given observations data. The algorithm combines genetic programming with the sparse regression. It could be used for governing analytical equation discovery as well as for partial differential equations (PDE) discovery.
  arXiv  Detail & Related papers  (2020-04-03T17:21:57Z)
• Stochasticity in Neural ODEs: An Empirical Study [68.8204255655161]
  Regularization of neural networks (e.g. dropout) is a widespread technique in deep learning that allows for better generalization. We show that data augmentation during the training improves the performance of both deterministic and versions of the same model. However, the improvements obtained by the data augmentation completely eliminate the empirical regularization gains, making the performance of neural ODE and neural SDE negligible.
  arXiv  Detail & Related papers  (2020-02-22T22:12:56Z)
• Data-Driven Discovery of Coarse-Grained Equations [0.0]
  Multiscale modeling and simulations are two areas where learning on simulated data can lead to such discovery. We replace the human discovery of such models with a machine-learning strategy based on sparse regression that can be executed in two modes. A series of examples demonstrates the accuracy, robustness, and limitations of our approach to equation discovery.
  arXiv  Detail & Related papers  (2020-01-30T23:41:37Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.