Abstract Identifying the governing equations of a nonlinear dynamical system is key to both understanding the physical features of the system and constructing an accurate model of the dynamics that generalizes well beyond the available data. Achieving this kind of interpretable system identification is even more difficult for partially observed systems. We propose a machine learning framework for discovering the governing equations of a dynamical system using only partial observations, combining an encoder for state reconstruction with a sparse symbolic model. The entire architecture is trained end-to-end by matching the higher-order symbolic time derivatives of the sparse symbolic model with finite difference estimates from the data. Our tests show that this method can successfully reconstruct the full system state and identify the equations of motion governing the underlying dynamics for a variety of ordinary differential equation (ODE) and partial differential equation (PDE) systems.
more »
« less
This content will become publicly available on January 1, 2026
TIME-SERIES FORECASTING AND REFINEMENT WITHIN A MULTIMODAL PDE FOUNDATION MODEL
Symbolic encoding has been used in multioperator learning (MOL) as a way to embed additional information for distinct time-series data. For spatiotemporal systems described by time-dependent partial differential equations (PDEs), the equation itself provides an additional modality to identify the system. The utilization of symbolic expressions alongside time-series samples allows for the development of multimodal predictive neural networks. A key challenge with current approaches is that the symbolic information, i.e., the equations, must be manually preprocessed (simplified, rearranged, etc.) to match and relate to the existing token library, which increases costs and reduces flexibility, especially when dealing with new differential equations. We propose a new token library based on SymPy to encode differential equations as an additional modality for time-series models. The proposed approach incurs minimal cost, is automated, and maintains high prediction accuracy for forecasting tasks. Additionally, we include a Bayesian filtering module that connects the different modalities to refine the learned equation. This improves the accuracy of the learned symbolic representation and the predicted time-series.
more »
« less
- Award ID(s):
- 2427558
- PAR ID:
- 10632454
- Publisher / Repository:
- begellhouse
- Date Published:
- Journal Name:
- Journal of Machine Learning for Modeling and Computing
- Volume:
- 6
- Issue:
- 2
- ISSN:
- 2689-3967
- Page Range / eLocation ID:
- 77 to 89
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
Pappas, George; Ravikumar, Pradeep; Seshia, Sanjit A (Ed.)We study the problem of learning neural network models for Ordinary Differential Equations (ODEs) with parametric uncertainties. Such neural network models capture the solution to the ODE over a given set of parameters, initial conditions, and range of times. Physics-Informed Neural Networks (PINNs) have emerged as a promising approach for learning such models that combine data-driven deep learning with symbolic physics models in a principled manner. However, the accuracy of PINNs degrade when they are used to solve an entire family of initial value problems characterized by varying parameters and initial conditions. In this paper, we combine symbolic differentiation and Taylor series methods to propose a class of higher-order models for capturing the solutions to ODEs. These models combine neural networks and symbolic terms: they use higher order Lie derivatives and a Taylor series expansion obtained symbolically, with the remainder term modeled as a neural network. The key insight is that the remainder term can itself be modeled as a solution to a first-order ODE. We show how the use of these higher order PINNs can improve accuracy using interesting, but challenging ODE benchmarks. We also show that the resulting model can be quite useful for situations such as controlling uncertain physical systems modeled as ODEs.more » « less
-
The confluent hypergeometric equation, also known as Kummer's equation, is one of the most important differential equations in physics, chemistry, and engineering. Its two power series solutions are the Kummer function, M(a,b,z), often referred to as the confluent hypergeometric function of the first kind, and M ≡ z1-bM(1+a-b, 2-b,z), where a and b are parameters that appear in the differential equation. A third function, the Tricomi function, U(a,b,z), sometimes referred to as the confluent hypergeometric function of the second kind, is also a solution of the confluent hypergeometric equation that is routinely used. Contrary to common procedure, all three of these functions (and more) must be considered in a search for the two linearly independent solutions of the confluent hypergeometric equation. There are situations, when a, b, and a - b are integers, where one of these functions is not defined, or two of the functions are not linearly independent, or one of the linearly independent solutions of the differential equation is different from these three functions. Many of these special cases correspond precisely to cases needed to solve problems in physics. This leads to significant confusion about how to work with confluent hypergeometric equations, in spite of authoritative references such as the NIST Digital Library of Mathematical Functions. Here, we carefully describe all of the different cases one has to consider and what the explicit formulas are for the two linearly independent solutions of the confluent hypergeometric equation. The procedure to properly solve the confluent hypergeometric equation is summarized in a convenient table. As an example, we use these solutions to study the bound states of the hydrogenic atom, correcting the standard treatment in textbooks. We also briefly consider the cutoff Coulomb potential. We hope that this guide will aid physicists to properly solve problems that involve the confluent hypergeometric differential equation.more » « less
-
Finch, a domain specific language and code generation framework for partial differential equations (PDEs), is demonstrated here to solve two classical problems: steady-state advection diffusion equation (single PDE) and the phonon Boltzmann transport equation (coupled PDEs). Both finite volume and finite element methods are explored. In addition to work presented at the 2022 International Conference on Computational Science (Heisler et al., 2022), we include recent developments for solving nonlinear equations using both automatic and symbolic differentiation, and demonstrate the capability for the Bratu (nonlinear Poisson) equation.more » « less
-
It is well known that the Painlevé equations can formally degenerate to autonomous differential equations with elliptic function solutions in suitable scaling limits. A way to make this degeneration rigorous is to apply Deift-Zhou steepest-descent techniques to a Riemann-Hilbert representation of a family of solutions. This method leads to an explicit approximation formula in terms of theta functions and related algebro-geometric ingredients that is difficult to directly link to the expected limiting differential equation. However, the approximation arises from an outer parametrix that satisfies relatively simple conditions. By applying a method that we learned from Alexander Its, it is possible to use these simple conditions to directly obtain the limiting differential equation, bypassing the details of the algebro-geometric solution of the outer parametrix problem. In this paper, we illustrate the use of this method to relate an approximation of the algebraic solutions of the Painlevé-III (D$$_7$$) equation valid in the part of the complex plane where the poles and zeros of the solutions asymptotically reside to a form of the Weierstraß equation.more » « less
An official website of the United States government
