Novel neural network solves PDEs with multi-scale resolution.
problem Solving time-dependent PDEs with varying spatial and temporal scales.
method Multi-scale message passing neural network with temporal and spatial gating modules.
result Outperforms baselines on PDEs with diverse scales.
DINo forecasts PDEs with flexible extrapolation and adaptability.
problem Fixed discretizations limit real-world PDE forecasting.
method DINo uses implicit neural representations for continuous-time dynamics.
result DINo outperforms other neural PDE forecasters.
Recent work has shown that reinforcement learning (RL) is a promising approach to control dynamical systems described by partial differential equations (PDE). This paper shows how to use RL to tackle more general PDE control problems that have continuous high-dimensional action spaces with spatial relationship among ac…
Extracts intrinsic spatial coordinates for complex agent systems to learn PDEs.
problem Modeling collective dynamics of heterogeneous agents.
method Data-driven extraction of intrinsic spatial coordinates, learning PDEs in emergent space.
result Collective dynamics can be approximated through learned PDEs in emergent coordinates.
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.
New model solves PDEs using probabilistic random grids.
problem Solving parametric PDEs with probabilistic collocation grids.
method Random Grid Neural Processes (RGNPs) with GICNets.
result Significant computational advantages and improved predictive capabilities.
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.
A new method uses deep learning to efficiently solve complex physics equations in high dimensions.
problem Efficiently solving high-dimensional time-dependent PDEs with dynamic solutions.
method Deep adaptive sampling framework for PINNs extended to spacetime domains using normalizing flows.
result The method effectively identifies and tracks high-residual regions in both space and time.
Derives PDEs for pricing RFR derivatives under a new FMM model.
problem Valuation of interest rate derivatives under a new FMM model.
method Develops PDEs and finite differences methods for numerical solution.
result First use of PDE methods for RFR derivatives valuation.
Quantum algorithm for multi-asset option pricing under different volatility models.
problem Efficiently pricing multi-asset options under various volatility models using quantum computing.
method Developed an end-to-end quantum PDE framework for European option pricing, solving PDEs after discretization on spatial grids.
result Quantum framework provides polynomial improvement in resource usage compared to classical methods.
A new method uses PDEs to predict spatiotemporal phenomena.
problem Predicting high-dimensional spatiotemporal data.
method Partial differential equations (PDEs) for spatiotemporal disentanglement.
result The method outperforms existing models in accuracy and applicability.
Physics-informed GANs estimate elastic moduli from mechanical tests.
problem Estimating spatially-varying elastic moduli from measured deformations.
method Physics-informed Generative Adversarial Networks (PI-GANs) with PDE constraints.
result Generated stiffness samples match true distribution statistics.
New neural network approach solves Poisson equations efficiently.
problem Approximating solutions to Poisson equations with Dirichlet boundary conditions.
method Using shallow ReLUα-networks to solve Laplace operator equations. result Neural networks can approximate solutions to the Laplace operator with Dirichlet boundary conditions efficiently.
Physics-informed WNO learns PDE solutions without labeled data.
problem Data-hungry nature of WNO framework.
method Physics-informed WNO for learning PDE solutions.
result Validated and illustrated with four nonlinear systems.
Framework uses physics knowledge to improve spatiotemporal prediction with limited data.
problem Challenges in modeling physical systems with limited real-world data.
method Physics-aware meta-learning with auxiliary tasks, incorporating PDE-independent spatial and temporal modules.
result Framework outperforms in spatiotemporal prediction tasks with limited data.
New boundary treatment improves accuracy for complex PDEs.
problem Order reduction in high-order IMEX schemes for multidimensional PDEs.
method Novel boundary treatment algorithms for Cartesian meshes, treating implicit-explicit stages similarly to interior points.
result Recovery of designed order of convergence by numerical verification.
The stability and robustness of compact schemes for parabolic PDEs are analyzed.
problem Stability and robustness of compact schemes for solving parabolic PDEs.
method Compact spatial discretization, Crank-Nicolson temporal discretization, eigenvalue analysis of amplification matrix.
result An upper bound on the condition number of the amplification matrix is derived, showing stability.
A contour integral method recently proposed by Weideman [IMA J. Numer. Anal., to appear] for integrating semi-discrete advection-diffusion PDEs, is extended for application to some of the important equations of mathematical finance. Using estimates for the numerical range of the spatial operator, optimal contour parame…
New framework for diffusion geometry simplifies complex calculations.
problem Challenges in applying calculus and geometry to real data.
method Reformulates calculus and geometry via diffusion processes.
result Improves precision, robustness, and computational efficiency.
New method models PDEs from noisy, limited data.
problem Modeling PDEs with incomplete, noisy data.
method Learned linear transformation of spatial grid points, followed by dynamics learning in a reduced basis, then back transformation.
result Rapid high-resolution simulations with smaller training data sets.
The comparison principle for scalar second order parabolic PDEs on functions u(t,x) admits a topological interpretation: pairs of solutions, u1(t,⋅) and u2(t,⋅), evolve so as to not increase the intersection number of their graphs. We generalize to the case of multiple solutions $\{u^α(t,\cdot)\}_{α=1}^…
Study analyzes derivative-free loss method for solving PDEs and fluid problems.
problem Solving elliptic PDEs and fluid problems using neural networks.
method Derivative-free loss method with Feynman-Kac formulation and stochastic walkers.
result Training loss bias scales with time interval and spatial gradient, inversely with walker size.
Probabilistic method combines space and time uncertainties in PDEs.
problem Separate treatment of space and time in PDE solvers obscures interactions and error quantification.
method Gaussian process interpretation of finite difference methods interacting with probabilistic ODE solvers.
result Joint quantification of space- and time-uncertainty possible without sacrificing ODE solver performance.
GRAND treats GNNs as PDE discretizations, addressing graph learning issues.
problem Graph learning issues like depth, oversmoothing, and bottlenecks.
method Models GNNs as a continuous diffusion process, treating them as PDE discretizations.
result Linear and nonlinear versions of GRAND achieve competitive results on graph benchmarks.
Extracts coarse-grained PDEs from microscopic simulations.
problem Discovering effective PDEs for macro-scale processes from microscopic data.
method Combining neural networks with equation-free numerics and data-driven approaches.
result Efficiently discovers macro-scale PDEs from microscopic simulations.
Deep learning predicts dynamics from sparse data.
problem Predicting spatiotemporal dynamics from sparse data.
method Spatially dimension-independent deep learning framework.
result Predicts dynamics from sparse data sites.
New approximative kernels improve PDE-G-CNNs for geometric deep learning.
problem Inaccurate approximations of exact kernels in PDE-G-CNNs.
method Developed new approximative kernels that work regardless of spatial anisotropy.
result New kernels provide better error estimates and maintain reflectional symmetries.
The paper sets limits for GNNs solving PDEs to avoid under-reaching phenomenon.
problem Under-reaching phenomenon in GNNs solving PDEs.
method Sharp lower bounds for message-passing iterations based on PDE characteristics.
result Proposed lower bounds ensure efficient information propagation in GNNs.
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.
High-dimensional partial differential equations (PDE) appear in a number of models from the financial industry, such as in derivative pricing models, credit valuation adjustment (CVA) models, or portfolio optimization models. The PDEs in such applications are high-dimensional as the dimension corresponds to the number …
We introduce a class of probability measure-valued diffusions, coined polynomial, of which the well-known Fleming--Viot process is a particular example. The defining property of finite dimensional polynomial processes considered by Cuchiero et al. (2012) and Filipovic and Larsson (2016) is transferred to this infinite …
We present high-order compact schemes for a linear second-order parabolic partial differential equation (PDE) with mixed second-order derivative terms in two spatial dimensions. The schemes are applied to option pricing PDE for a family of stochastic volatility models. We use a non-uniform grid with more grid-points ar…
NWoS solves high-dimensional Poisson equations using neural networks.
problem Efficiently solving high-dimensional Poisson equations.
method Neural Walk-on-Spheres (NWoS) leveraging stochastic representations and Walk-on-Spheres methods.
result NWoS outperforms competing methods in accuracy, speed, and computational costs.
Efficiently values and computes sensitivities of Bermudan options using Method of Lines.
problem Valuation and sensitivities of Bermudan options.
method Method of Lines converting Black Scholes PDE to ODEs, spatial discretization, exponential matrix operation for efficiency.
result Computational efficiency and straightforward implementation for computing sensitivities.
This work combines machine learning with physical models to solve inverse problems efficiently.
problem Solving inverse problems in the presence of missing physics and recovering parameters.
method Variational autoencoding with a physically structured decoder network and stochastic local approximations.
result The method accelerates inference for Bayesian inverse problems and acts as a regularizer encoding prior physical information.
MCNO learns PDE solution operators using Monte Carlo sampling.
problem Learning solution operators for PDEs efficiently and flexibly.
method Directly learns kernel function using Monte Carlo sampling of input-output pairs.
result Competitive accuracy with efficient computational cost on 1D PDE benchmarks.
GrADE uses graph neural networks and Neural ODE for solving time-dependent nonlinear PDEs efficiently.
problem Solving time-dependent nonlinear PDEs is computationally challenging and time-consuming.
method GrADE combines graph neural networks for spatial modeling and Neural ODE for temporal modeling, using attention mechanisms.
result GrADE efficiently solves PDEs, demonstrating scalability and better accuracy compared to existing methods.
Enhances POU-Nets with probabilistic noise model for efficient spatial data clustering.
problem Improving the efficiency and accuracy of deep learning models for spatial data.
method Integrates Gaussian noise model into POU-Nets to enable gradient-based optimization and hierarchical refinement.
result Achieves sharp spatial partitions and higher-order polynomial approximation without regularizers.
New approach connects UQ in SciML to viscous HJ PDEs for efficient uncertainty quantification.
problem Challenges in interpretability and expensive training procedures in UQ for SciML.
method Established connection between Bayesian inference and viscous HJ PDEs, developed Riccati-based methodology.
result Efficiently updates model predictions without retraining or data access, suitable for real-time inferences.
Modeling wind dynamics in Saudi Arabia using deep learning and stochastic PDEs.
problem Accurately modeling spatio-temporal wind patterns in a large, diverse, and understudied region.
method Energy distance-based spatial reduction, sparse stochastic Echo State Network, non-stationary stochastic PDE reconstruction.
result Produces more accurate wind speed and energy forecasts, saving $1 million annually.
In this paper, we consider nonlinear PDEs in a port-Hamiltonian setting based on an underlying jet-bundle structure. We restrict ourselves to systems with 1-dimensional spatial domain and 2nd-order Hamiltonian including certain dissipation models that can be incorporated in the port- Hamiltonian framework by means of a…
RandNet-Parareal uses neural networks to speed up time-parallel PDE solving.
problem Solving systems of time-dependent differential equations efficiently.
method Combines Parareal's sequential and parallel approach with random neural networks.
result Achieves up to 125x and 22x speedup compared to existing methods.
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.
We analyze the dynamics of an online algorithm for independent component analysis in the high-dimensional scaling limit. As the ambient dimension tends to infinity, and with proper time scaling, we show that the time-varying joint empirical measure of the target feature vector and the estimates provided by the algorith…
Discover equations from data using neural networks with constraints.
problem Discover equations from noisy data without theoretical derivation.
method Solve constrained optimization problem with penalty or trust-region barrier methods.
result Constrained method outperforms penalty method for higher noise levels or fewer collocation points.
We explore the use of graph neural networks (GNNs) to model spatial processes in which there is no a priori graphical structure. Similar to finite element analysis, we assign nodes of a GNN to spatial locations and use a computational process defined on the graph to model the relationship between an initial function de…
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.