Bayesian method discovers PDEs with variable coefficients robustly.
problem Discovering PDEs from noisy data is challenging.
method Bayesian sparse learning with tBGL-SS and Gibbs sampler.
result Method enhances robustness and model selection criteria.
GenMod uses generative models to approximate high-dimensional PDE solutions with limited evaluations.
problem Quantifying uncertainty in high-dimensional PDE systems with random parameters.
method Develops a method using generative models to approximate polynomial chaos coefficients in underdetermined systems.
result The method outperforms sparsity-promoting methods in approximating PDE solutions with limited evaluations.
Novel approach ensures stability of compact schemes for variable PDEs.
problem Ensuring stability of compact schemes for variable coefficient PDEs.
method Difference equation approach to derive stability conditions.
result Derives sufficient condition for unconditional stability.
New framework discovers PDEs from sparse, noisy data.
problem Discovering PDEs from sparse and noisy data.
method Combines neural network, genetic algorithm, and adaptive methods.
result Robust to sparse and noisy data, discovers parametric PDEs.
Implicit schemes are popular methods for the integration of time dependent PDEs such as hyperbolic and parabolic PDEs. However the necessity to solve corresponding linear systems at each time step constitutes a complexity bottleneck in their application to PDEs with rough coefficients. We present a generalization of ga…
Framework uses deep learning and statistical models to solve PDEs with discontinuous coefficients.
problem Solving PDEs with discontinuous coefficients.
method Two-stage physics-informed deep learning and statistical mixture models.
result Framework achieves adaptability and accurate parameter identification.
The paper shows how neural networks can approximate PDEs with polynomial scaling in dimension.
problem Understanding the complexity of approximating PDE solutions with neural networks.
method Developed a proof technique to simulate gradient descent using neural networks.
result Neural network parameters scale polynomially with input dimension for approximating PDE solutions.
This paper addresses parameter estimation for wave equations with Markovian switching.
problem Parameter estimation for wave equations with abrupt changes.
method Bayesian statistical framework using discrete sparse Bayesian learning.
result Strong performance in parameter estimation for variable coefficient PDEs.
We provide new exact Taylor's series with fixed coefficients and without the remainder. We demonstrate the usefulness of this contribution by using it to obtain very simple solutions to (non-linear) PDEs. We also apply the method to the portfolio model.
EPGP priors solve linear PDEs from data.
problem Modeling physical systems with PDEs.
method EPGP priors based on Ehrenpreis-Palamodov principle.
result EPGP priors improve computation time and precision.
Automated PDE discovery from multiple noisy experiments.
problem Inherent variability in experiments makes single experiment inference unreliable.
method Randomised adaptive group Lasso sparsity estimator in deep learning framework.
result More generalizable PDEs found from multiple datasets.
PAGP uses physics-assisted Gaussian processes to solve and learn PDEs.
problem Solving and discovering unknown coefficients in PDEs with initial and boundary conditions.
method Physics-assisted Gaussian processes with continuous, discrete, and hybrid models.
result Effective in solving and discovering unknown coefficients in PDEs.
We propose a data-driven approach to solve multiscale elliptic PDEs with random coefficients based on the intrinsic low dimension structure of the underlying elliptic differential operators. Our method consists of offline and online stages. At the offline stage, a low dimension space and its basis are extracted from th…
PDMP samplers improve Bayesian PDE coefficient inference.
problem Efficient Bayesian inference in non-linear inverse problems with expensive likelihoods.
method Piecewise deterministic Markov process (PDMP) with surrogate-assisted thinning.
result PDMP samplers achieve higher accuracy and efficiency than traditional methods.
Meta-learning neural networks to solve diverse PDEs efficiently.
problem Efficiently solving new PDE problems with minimal training.
method Neural network meta-learning of PDE problem representations.
result Meta-learned neural networks predict PDE solutions with high accuracy.
New method uses Gaussian processes for solving linear PDEs with boundary conditions.
problem Solving linear PDEs with boundary conditions.
method Boundary Ehrenpreis--Palamodov Gaussian Processes (B-EPGPs).
result Significant accuracy and resource improvements over existing methods.
Efficiently computes sparse signature coefficients using kernels.
problem Lack of efficient methods for sparse signature coefficients.
method Signature kernels and PDE-based methods.
result Sparse groups of signature coefficients can be isolated effectively.
Random feature model approximates PDE solutions efficiently.
problem Approximating solutions to PDEs with high-dimensional inputs and outputs.
method Random feature model applied to infinite-dimensional operators.
result Efficient and accurate approximation of PDE solutions.
For each simple Lie algebra g (excluding, for trivial reasons, type C) we find the lowest possible degree of an invariant second-order PDE over the adjoint variety in Pg, a homogeneous contact manifold. Here a PDE F(xi,u,ui,uij)=0 has degree ≤d if F is a polynomi…
Deep learning solves high-dimensional PDEs efficiently.
problem Solving high-dimensional Kolmogorov PDEs numerically.
method Reformulating as a statistical learning problem using Feynman-Kac formula.
result Single neural network learns entire family of PDEs.
PILNO uses neural operators to solve PDEs efficiently on point clouds.
problem Solving partial differential equations (PDEs) on point cloud data efficiently.
method Physics-informed low-rank neural operator framework combining low-rank kernel approximations and an encoder-decoder architecture.
result PILNO efficiently approximates solution operators of PDEs on point cloud data, satisfying PDE constraints and boundary conditions.
Study shows how market firm capitalization models converge to stochastic PDE solutions.
problem Understanding convergence of rank-based models with common noise to stochastic PDE solutions.
method Analysis of mean field limit, martingale problem, and pathwise entropy solutions.
result Empirical cumulative distribution function converges to solution of a stochastic PDE under certain conditions.
We propose a numerical method for solving high dimensional fully nonlinear partial differential equations (PDEs). Our algorithm estimates simultaneously by backward time induction the solution and its gradient by multi-layer neural networks, while the Hessian is approximated by automatic differentiation of the gradient…
We propose a neural network-based algorithm for solving forward and inverse problems for partial differential equations in unsupervised fashion. The solution is approximated by a deep neural network which is the minimizer of a cost function, and satisfies the PDE, boundary conditions, and additional regularizations. Th…
PDE-based G-CNNs add geometric symmetries to CNNs without augmentation.
problem Designing CNNs with built-in symmetries like rotation.
method Formulate CNN layers as PDE solvers on homogeneous spaces.
result PDE-G-CNNs achieve better performance with fewer parameters.
New method converts video of dye plumes into PDEs for better understanding.
problem Inferring continuum models from uncalibrated video data.
method Develops a pipeline to convert grayscale recordings into scalar fields, isolates drift, and identifies transport laws.
result Selected reduced model outperforms advection-diffusion baselines and retains structural interpretability.
We prove a priori estimates for a generalised Monge-Ampère PDE with "non-constant coefficients" thus improving a result of Sun in the Kähler case. We apply this result to the deformed Hermitian Yang-Mills (dHYM) equation of Jacob-Yau to obtain an existence result and a priori estimates for some ranges of the phase angl…
Bayesian PINN improves estimation of PDE solutions from noisy data.
problem Estimating solutions of PDEs from noisy measurements.
method Bayesian approach to Physics-informed neural networks (PINNs) for inverse problems.
result Convergence rate of Bayesian posterior mean error in PDE solutions.
FM4PDE learns PDE solutions from sparse data.
problem Reconstructing PDE solutions from limited observations.
method Flow-matching generative framework that learns PDE coefficients and solutions.
result Error guarantees for guided procedures, including deterministic and stochastic samplers.
Study supports recovery of PDEs from noisy data using a specific regularization method.
problem Support recovery of PDEs from a single noisy trajectory.
method Applying ℓ1-regularized Pseudo-Least Squares model to a given data set.
result Support of ℓ1-c coefficients asymptotically converges to the true signed-support of the PDE.
Secondary Calculus formalizes PDEs using cohomology, simplifying their study.
problem Formalizing and simplifying the study of partial differential equations (PDEs).
method Using cohomology of diffieties to formalize PDEs and their properties.
result Differential calculus on PDE solution spaces is homotopy calculus on horizontal De Rham algebras of diffieties.
Hybrid LSMC-PDE method for Bermudan options under GDMR model.
problem Pricing Bermudan options under the GDMR model.
method Adapted Hybrid LSMC-PDE framework, combining Monte Carlo and PDE methods.
result Hybrid approach yields more accurate and lower error estimates than plain LSMC.
We show that our generalization of the Black-Scholes partial differential equation (pde) for nontrivial diffusion coefficients is equivalent to a Martingale in the risk neutral discounted stock price. Previously, this was proven for the case of the Gaussian logarithmic returns model by Harrison and Kreps, but we prove …
We introduce a near-linear complexity (geometric and meshless/algebraic) multigrid/multiresolution method for PDEs with rough (L∞) coefficients with rigorous a-priori accuracy and performance estimates. The method is discovered through a decision/game theory formulation of the problems of (1) identifying restri…
In this paper we show how to augment classical methods for inverse problems with artificial neural networks. The neural network acts as a prior for the coefficient to be estimated from noisy data. Neural networks are global, smooth function approximators and as such they do not require explicit regularization of the er…
This paper studies pricing derivatives in an age-dependent semi-Markov modulated market. We consider a financial market where the asset price dynamics follow a regime switching geometric Brownian motion model in which the coefficients depend on finitely many age-dependent semi-Markov processes. We further allow the vol…
Polynomial Chaos Expansion improves operator learning for PDEs.
problem Approximating mappings between infinite-dimensional functional spaces.
method Polynomial Chaos Expansion (PCE) for operator learning.
result PCE achieves strong performance in operator learning and uncertainty quantification.
Paper proposes an analytical pricing model for puttable bonds with credit risk.
problem Analytical pricing of puttable bonds with credit risk.
method Developed a 2-factor structural PDE model and derived analytical pricing formula under specific conditions.
result Derived analytical pricing formula for puttable bonds with credit risk.
Efficient surrogate modeling for complex PDEs with physical laws.
problem High computational cost of repeated PDE simulations.
method LC-prior Gaussian process with POD and RBF-FD.
result Significantly reduced computational cost and improved accuracy.
Online algorithm identifies PDEs from noisy data snapshots.
problem Identifying PDEs from sequential solution snapshots.
method Combines weak-form discretization with online proximal gradient descent.
result Efficiently identifies and tracks systems with time-varying coefficients.
Machine learning for scientific applications faces the challenge of limited data. We propose a framework that leverages a priori known physics to reduce overfitting when training on relatively small datasets. A deep neural network is embedded in a partial differential equation (PDE) that expresses the known physics and…
Extends unbiased simulation method to Asian options.
problem Simulating path-dependent dynamics for Asian options.
method Extension of unbiased simulation method for SDEs to path-dependent dynamics.
result Extension applies to numerical resolution of path-dependent PDEs.
The paper develops methods to price and hedge options in path-dependent stock models.
problem Pricing and hedging options under complex stock models.
method Develops a path-dependent PDE for option pricing and differentiability of path-dependent SDE solutions.
result Provides formulas for option Greeks and differentiability of path-dependent SDE solutions.
We discuss a Bayesian formulation to coarse-graining (CG) of PDEs where the coefficients (e.g. material parameters) exhibit random, fine scale variability. The direct solution to such problems requires grids that are small enough to resolve this fine scale variability which unavoidably requires the repeated solution of…
WSINDy for PDEs robustly identifies models from noisy data.
problem Identifying nonlinear dynamics from noisy partial differential equations data.
method Weak formulation of PDEs, Fourier-based model identification, sequential-thresholding least-squares.
result WSINDy enables robust identification of PDEs in noisy conditions.
We investigate second order quasilinear equations of the form f_{ij} u_{x_ix_j}=0 where u is a function of n independent variables x_1, ..., x_n, and the coefficients f_{ij} are functions of the first order derivatives p^1=u_{x_1}, >..., p^n=u_{x_n} only. We demonstrate that the natural equivalence group of the problem…
New learning scheme solves high-dimensional semi-linear PDEs using sparse grids and Picard approximations.
problem Solving high-dimensional semi-linear parabolic PDEs.
method Probabilistic learning scheme based on Picard iteration with SGD, employing sparse grid approximation.
result Convergence proof and polynomial complexity in ε−1 for high-dimensional PDEs. Clarifies relation for solving control-affine Schrödinger bridge problems.
problem Solving control-affine Schrödinger bridge problems via Hopf-Cole transform.
method Applies Hopf-Cole transform to conditions of optimality, resulting in nonlinear PDEs.
result Generic control-affine Schrödinger bridge requires further algorithmic development.