DiffusionPDE: Generative PDE-Solving Under Partial Observation

• URL: http://arxiv.org/abs/2406.17763v2
• Date: Fri, 01 Nov 2024 00:08:54 GMT
• Title: DiffusionPDE: Generative PDE-Solving Under Partial Observation
• Authors: Jiahe Huang, Guandao Yang, Zichen Wang, Jeong Joon Park,
• Abstract summary: 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.
• Score: 10.87702379899977
• License:
• Abstract: We introduce a general framework for solving partial differential equations (PDEs) using generative diffusion models. In particular, we focus on the scenarios where we do not have the full knowledge of the scene necessary to apply classical solvers. Most existing forward or inverse PDE approaches perform poorly when the observations on the data or the underlying coefficients are incomplete, which is a common assumption for real-world measurements. In this work, we propose DiffusionPDE that can simultaneously fill in the missing information and solve a PDE by modeling the joint distribution of the solution and coefficient spaces. We show that the learned generative priors lead to a versatile framework for accurately solving a wide range of PDEs under partial observation, significantly outperforming the state-of-the-art methods for both forward and inverse directions.

Related papers

• Total Uncertainty Quantification in Inverse PDE Solutions Obtained with Reduced-Order Deep Learning Surrogate Models [50.90868087591973]
  We propose an approximate Bayesian method for quantifying the total uncertainty in inverse PDE solutions obtained with machine learning surrogate models. We test the proposed framework by comparing it with the iterative ensemble smoother and deep ensembling methods for a non-linear diffusion equation.
  arXiv  Detail & Related papers  (2024-08-20T19:06:02Z)
• Base Models for Parabolic Partial Differential Equations [30.565534769404536]
  Parabolic partial differential equations (PDEs) appear in many disciplines to model the evolution of various mathematical objects. It is often necessary to compute the solutions or a function of the solutions to a parametric PDE in multiple scenarios corresponding to different parameters of this PDE. We propose a framework for finding solutions to parabolic PDEs across different scenarios by meta-learning an underlying base.
  arXiv  Detail & Related papers  (2024-07-17T01:04:28Z)
• Physics-Aware Neural Implicit Solvers for multiscale, parametric PDEs with applications in heterogeneous media [1.8416014644193066]
  We propose a novel, data-driven framework for learning surrogates for parametrized Partial Differential Equations (PDEs) It consists of a probabilistic, learning objective in which weighted residuals are used to probe the PDE and provide a source of em virtual data i.e. the actual PDE never needs to be solved. This is combined with a physics-aware implicit solver that consists of a much coarser, discretized version of the original PDE.
  arXiv  Detail & Related papers  (2024-05-29T12:01:49Z)
• 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)
• AdjointDEIS: Efficient Gradients for Diffusion Models [2.0795007613453445]
  We show that continuous adjoint equations for diffusion SDEs actually simplify to a simple ODE. We also demonstrate the effectiveness of AdjointDEIS for guided generation with an adversarial attack in the form of the face morphing problem.
  arXiv  Detail & Related papers  (2024-05-23T19:51:33Z)
• Closure Discovery for Coarse-Grained Partial Differential Equations Using Grid-based Reinforcement Learning [2.9611509639584304]
  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.
  arXiv  Detail & Related papers  (2024-02-01T19:41:04Z)
• 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)
• 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)
• A Neural RDE-based model for solving path-dependent PDEs [5.6293920097580665]
  The concept of the path-dependent partial differential equation (PPDE) was first introduced in the context of path-dependent derivatives in financial markets. Compared to the classical PDE, the solution of a PPDE involves an infinite-dimensional spatial variable. We propose a rough neural differential equation (NRDE)-based model to learn PPDEs, which effectively encodes the path information through the log-signature feature.
  arXiv  Detail & Related papers  (2023-06-01T20:19:41Z)
• PDE+: Enhancing Generalization via PDE with Adaptive Distributional Diffusion [66.95761172711073]
  generalization of neural networks is a central challenge in machine learning. We propose to enhance it directly through the underlying function of neural networks, rather than focusing on adjusting input data. We put this theoretical framework into practice as $textbfPDE+$ ($textbfPDE$ with $textbfA$daptive $textbfD$istributional $textbfD$iffusion)
  arXiv  Detail & Related papers  (2023-05-25T08:23:26Z)
• 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)

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.