Closure Discovery for Coarse-Grained Partial Differential Equations Using Grid-based Reinforcement Learning

• URL: http://arxiv.org/abs/2402.00972v2
• Date: Thu, 23 May 2024 15:48:05 GMT
• Title: Closure Discovery for Coarse-Grained Partial Differential Equations Using Grid-based Reinforcement Learning
• Authors: Jan-Philipp von Bassewitz, Sebastian Kaltenbach, Petros Koumoutsakos,
• Abstract summary: We propose a systematic approach for identifying closures in under-resolved PDEs using grid-based Reinforcement Learning. We demonstrate the capabilities and limitations of our framework through numerical solutions of the advection equation and the Burgers' equation.
• Score: 2.9611509639584304
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Reliable predictions of critical phenomena, such as weather, wildfires and epidemics often rely on models described by Partial Differential Equations (PDEs). However, simulations that capture the full range of spatio-temporal scales described by such PDEs are often prohibitively expensive. Consequently, coarse-grained simulations are usually deployed that adopt various heuristics and empirical closure terms to account for the missing information. We propose a novel and systematic approach for identifying closures in under-resolved PDEs using grid-based Reinforcement Learning. This formulation incorporates inductive bias and exploits locality by deploying a central policy represented efficiently by a Fully Convolutional Network (FCN). We demonstrate the capabilities and limitations of our framework through numerical solutions of the advection equation and the Burgers' equation. Our results show accurate predictions for in- and out-of-distribution test cases as well as a significant speedup compared to resolving all scales.

Related papers

• Convergence of Score-Based Discrete Diffusion Models: A Discrete-Time Analysis [56.442307356162864]
  We study the theoretical aspects of score-based discrete diffusion models under the Continuous Time Markov Chain (CTMC) framework. We introduce a discrete-time sampling algorithm in the general state space $[S]d$ that utilizes score estimators at predefined time points. Our convergence analysis employs a Girsanov-based method and establishes key properties of the discrete score function.
  arXiv  Detail & Related papers  (2024-10-03T09:07:13Z)
• DiffusionPDE: Generative PDE-Solving Under Partial Observation [10.87702379899977]
  We introduce a general framework for solving partial differential equations (PDEs) using generative diffusion models. We show that the learned generative priors lead to a versatile framework for accurately solving a wide range of PDEs under partial observation.
  arXiv  Detail & Related papers  (2024-06-25T17:48:24Z)
• Gaussian Mixture Solvers for Diffusion Models [84.83349474361204]
  We introduce a novel class of SDE-based solvers called GMS for diffusion models. Our solver outperforms numerous SDE-based solvers in terms of sample quality in image generation and stroke-based synthesis.
  arXiv  Detail & Related papers  (2023-11-02T02:05:38Z)
• Causal Modeling with Stationary Diffusions [89.94899196106223]
  We learn differential equations whose stationary densities model a system's behavior under interventions. We show that they generalize to unseen interventions on their variables, often better than classical approaches. Our inference method is based on a new theoretical result that expresses a stationarity condition on the diffusion's generator in a reproducing kernel Hilbert space.
  arXiv  Detail & Related papers  (2023-10-26T14:01:17Z)
• Discovering stochastic partial differential equations from limited data using variational Bayes inference [0.0]
  We propose a novel framework for discovering Partial Differential Equations (SPDEs) from data. The proposed approach combines the concepts of calculus, variational Bayes theory, and sparse learning. This is the first attempt at discovering SPDEs from data, and it has significant implications for various scientific applications.
  arXiv  Detail & Related papers  (2023-06-28T02:18:04Z)
• Efficient CDF Approximations for Normalizing Flows [64.60846767084877]
  We build upon the diffeomorphic properties of normalizing flows to estimate the cumulative distribution function (CDF) over a closed region. Our experiments on popular flow architectures and UCI datasets show a marked improvement in sample efficiency as compared to traditional estimators.
  arXiv  Detail & Related papers  (2022-02-23T06:11:49Z)
• Partial Counterfactual Identification from Observational and Experimental Data [83.798237968683]
  We develop effective Monte Carlo algorithms to approximate the optimal bounds from an arbitrary combination of observational and experimental data. Our algorithms are validated extensively on synthetic and real-world datasets.
  arXiv  Detail & Related papers  (2021-10-12T02:21:30Z)
• Stationary Density Estimation of It\^o Diffusions Using Deep Learning [6.8342505943533345]
  We consider the density estimation problem associated with the stationary measure of ergodic Ito diffusions from a discrete-time series. We employ deep neural networks to approximate the drift and diffusion terms of the SDE. We establish the convergence of the proposed scheme under appropriate mathematical assumptions.
  arXiv  Detail & Related papers  (2021-09-09T01:57:14Z)
• Parsimony-Enhanced Sparse Bayesian Learning for Robust Discovery of Partial Differential Equations [5.584060970507507]
  A Parsimony Enhanced Sparse Bayesian Learning (PeSBL) method is developed for discovering the governing Partial Differential Equations (PDEs) of nonlinear dynamical systems. Results of numerical case studies indicate that the governing PDEs of many canonical dynamical systems can be correctly identified using the proposed PeSBL method.
  arXiv  Detail & Related papers  (2021-07-08T00:56:11Z)
• Bayesian data-driven discovery of partial differential equations with variable coefficients [9.331440154110117]
  We propose an advanced Bayesian sparse learning algorithm for PDE discovery with variable coefficients. In the experiments, we show that the tBGL-SS method is more robust than the baseline methods under noisy environments.
  arXiv  Detail & Related papers  (2021-02-02T11:05:34Z)
• Combining Differentiable PDE Solvers and Graph Neural Networks for Fluid Flow Prediction [79.81193813215872]
  We develop a hybrid (graph) neural network that combines a traditional graph convolutional network with an embedded differentiable fluid dynamics simulator inside the network itself. We show that we can both generalize well to new situations and benefit from the substantial speedup of neural network CFD predictions.
  arXiv  Detail & Related papers  (2020-07-08T21:23:19Z)

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.