Any equation is a forest: Symbolic genetic algorithm for discovering open-form partial differential equations (SGA-PDE)

• URL: http://arxiv.org/abs/2106.11927v1
• Date: Wed, 9 Jun 2021 06:46:13 GMT
• Title: Any equation is a forest: Symbolic genetic algorithm for discovering open-form partial differential equations (SGA-PDE)
• Authors: Yuntian Chen, Yingtao Luo, Qiang Liu, Hao Xu, and Dongxiao Zhang
• Abstract summary: Partial differential equations (PDEs) are concise and understandable representations of domain knowledge. We propose the symbolic genetic algorithm (SGA-PDE) to discover open-form PDEs directly from data without prior knowledge about the equation structure.
• Score: 8.004315522141294
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Partial differential equations (PDEs) are concise and understandable representations of domain knowledge, which are essential for deepening our understanding of physical processes and predicting future responses. However, the PDEs of many real-world problems are uncertain, which calls for PDE discovery. We propose the symbolic genetic algorithm (SGA-PDE) to discover open-form PDEs directly from data without prior knowledge about the equation structure. SGA-PDE focuses on the representation and optimization of PDE. Firstly, SGA-PDE uses symbolic mathematics to realize the flexible representation of any given PDE, transforms a PDE into a forest, and converts each function term into a binary tree. Secondly, SGA-PDE adopts a specially designed genetic algorithm to efficiently optimize the binary trees by iteratively updating the tree topology and node attributes. The SGA-PDE is gradient-free, which is a desirable characteristic in PDE discovery since it is difficult to obtain the gradient between the PDE loss and the PDE structure. In the experiment, SGA-PDE not only successfully discovered nonlinear Burgers' equation, Korteweg-de Vries (KdV) equation, and Chafee-Infante equation, but also handled PDEs with fractional structure and compound functions that cannot be solved by conventional PDE discovery methods.

Related papers

• Unisolver: PDE-Conditional Transformers Are Universal PDE Solvers [55.0876373185983]
  We present the Universal PDE solver (Unisolver) capable of solving a wide scope of PDEs. Our key finding is that a PDE solution is fundamentally under the control of a series of PDE components. Unisolver achieves consistent state-of-the-art results on three challenging large-scale benchmarks.
  arXiv  Detail & Related papers  (2024-05-27T15:34:35Z)
• Data-Driven Discovery of PDEs via the Adjoint Method [4.014524824655106]
  We present an adjoint-based method for discovering the underlying governing partial differential equations (PDEs) given data. We show the efficacy of the proposed approach in identifying the form of the PDE. We also compare its performance with the famous PDE Functional Identification of Dynamics method known as PDE-FIND.
  arXiv  Detail & Related papers  (2024-01-30T17:10:42Z)
• Deep Equilibrium Based Neural Operators for Steady-State PDEs [100.88355782126098]
  We study the benefits of weight-tied neural network architectures for steady-state PDEs. We propose FNO-DEQ, a deep equilibrium variant of the FNO architecture that directly solves for the solution of a steady-state PDE.
  arXiv  Detail & Related papers  (2023-11-30T22:34:57Z)
• PDE-LEARN: Using Deep Learning to Discover Partial Differential Equations from Noisy, Limited Data [0.0]
  We introduce PDE-LEARN, a novel PDE discovery algorithm that can identify governing partial differential equations (PDEs) directly from noisy, limited measurements. PDE-LEARN uses a Rational Neural Network, $U$, to approximate the system response function and a sparse, trainable vector, $xi$, to characterize the hidden PDE. We demonstrate the efficacy of PDE-LEARN by identifying several PDEs from noisy and limited measurements.
  arXiv  Detail & Related papers  (2022-12-09T16:33:52Z)
• DISCOVER: Deep identification of symbolic open-form PDEs via enhanced reinforcement-learning [0.5156484100374059]
  The working mechanisms of complex natural systems tend to abide by concise and profound partial differential equations (PDEs) In this paper, an enhanced deep reinforcement-learning framework is proposed to uncover symbolic open-form PDEs with little prior knowledge.
  arXiv  Detail & Related papers  (2022-10-04T15:46:53Z)
• Learning differentiable solvers for systems with hard constraints [48.54197776363251]
  We introduce a practical method to enforce partial differential equation (PDE) constraints for functions defined by neural networks (NNs) We develop a differentiable PDE-constrained layer that can be incorporated into any NN architecture. Our results show that incorporating hard constraints directly into the NN architecture achieves much lower test error when compared to training on an unconstrained objective.
  arXiv  Detail & Related papers  (2022-07-18T15:11:43Z)
• Fourier Neural Operator with Learned Deformations for PDEs on General Geometries [75.91055304134258]
  We propose a new framework, viz., geo-FNO, to solve PDEs on arbitrary geometries. Geo-FNO learns to deform the input (physical) domain, which may be irregular, into a latent space with a uniform grid. We consider a variety of PDEs such as the Elasticity, Plasticity, Euler's, and Navier-Stokes equations, and both forward modeling and inverse design problems.
  arXiv  Detail & Related papers  (2022-07-11T21:55:47Z)
• Learning time-dependent PDE solver using Message Passing Graph Neural Networks [0.0]
  We introduce a graph neural network approach to finding efficient PDE solvers through learning using message-passing models. We use graphs to represent PDE-data on an unstructured mesh and show that message passing graph neural networks (MPGNN) can parameterize governing equations. We show that a recurrent graph neural network approach can find a temporal sequence of solutions to a PDE.
  arXiv  Detail & Related papers  (2022-04-15T21:10:32Z)
• Lie Point Symmetry Data Augmentation for Neural PDE Solvers [69.72427135610106]
  We present a method, which can partially alleviate this problem, by improving neural PDE solver sample complexity. In the context of PDEs, it turns out that we are able to quantitatively derive an exhaustive list of data transformations. We show how it can easily be deployed to improve neural PDE solver sample complexity by an order of magnitude.
  arXiv  Detail & Related papers  (2022-02-15T18:43:17Z)
• dNNsolve: an efficient NN-based PDE solver [62.997667081978825]
  We introduce dNNsolve, that makes use of dual Neural Networks to solve ODEs/PDEs. We show that dNNsolve is capable of solving a broad range of ODEs/PDEs in 1, 2 and 3 spacetime dimensions.
  arXiv  Detail & Related papers  (2021-03-15T19:14:41Z)

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.