New PDEs of mixed type emerge in fluid mechanics and geometry.
problem Analysis of nonlinear PDEs of mixed type.
method Through historical problems and recent trends.
result Many PDEs are of mixed type, requiring new analysis.
New method solves PDEs on spheres using physics-informed convolutional neural networks.
problem Solving PDEs on surfaces, especially spheres, with high accuracy and efficiency.
method Physics-informed convolutional neural networks (PICNN) with theoretical analysis and approximation results.
result Established fast convergence rates for PICNN solving PDEs on spheres.
Error estimates for nonlinear PDEs using kernel/GP methods.
problem Error analysis of kernel/GP methods for nonlinear and parametric PDEs.
method Sobolev space error estimates based on minimizing norm property of the solution.
result Dimension-benign convergence rates for smooth solutions.
Efficiently solves inverse PDE problems with Gaussian processes.
problem Solving inverse problems in linear PDEs with noisy data.
method Gaussian process regression with algebraic priors.
result High accuracy and computational efficiency achieved.
Local Neural Operators enable efficient system-level analysis of complex PDEs.
problem System-level analysis of large-scale dynamical systems using neural operators.
method Integrating local Neural Operators with Krylov subspace iterative methods for stability and bifurcation analysis.
result Demonstrated effectiveness of local Neural Operators in fixed-point, stability, and bifurcation analysis of nonlinear PDEs.
Paper analyzes and proves convergence of a new method for solving complex PDEs.
problem Solving high-dimensional nonlinear PDEs and PIDEs with random neural networks.
method Random deep splitting method using random neural networks.
result The method converges to the unique viscosity solution of nonlinear PDEs and PIDEs.
PDE model predicts Bitcoin price using transaction network and sentiment data.
problem Predicting Bitcoin price with high accuracy.
method Partial differential equation model on Bitcoin transaction network, incorporating Google Trends Index.
result Average daily bitcoin price prediction accuracy of 0.82 over 362 days in 2017.
Paper analyzes DRM for solving high-dimensional elliptic PDEs with generalization bounds.
problem Analyzing generalization error of neural network methods for high-dimensional PDEs.
method Developed a new solution theory for spectral Barron space and derived generalization error bounds.
result Generalization error bounds are independent of dimension and solutions lie in spectral Barron space.
Study moduli spaces of elliptic PDEs using derived C∞-geometry.
problem Representability of moduli spaces of solutions of elliptic PDEs.
method Derived C∞-geometry, stacks of relative jets, nonlinear Fredholm analysis. result Moduli stack of solutions is relatively representable by quasi-smooth derived C∞-schemes. New methods solve complex PDEs with mixed boundary conditions.
problem Solving inhomogeneous Robin type boundary value problems for linear PDEs.
method Odd and even Hilbert transforms.
result Non-standard solutions to various PDEs in finance, stochastic analysis, etc.
Study evaluates Deep PDE solvers for high-dimensional option pricing, identifying key sources of error.
problem Empirical study on error analysis of Deep PDE solvers for high-dimensional option pricing.
method Comparative experiments with Deep BSDE method and other solvers, identifying three main sources of error.
result Deep BSDE method is superior and robust to option specifications, improving with larger batch sizes and fewer time steps.
In this article, we propose a new numerical approach to high-dimensional partial differential equations (PDEs) arising in the valuation of exotic derivative securities. The proposed method is extended from Reisinger and Wittum (2007) and uses principal component analysis (PCA) of the underlying process in combination w…
The paper solves PDEs from matrices with orthogonal columns, linking them to Hessian metrics and symmetric spaces.
problem Solving third order PDEs for strictly convex smooth functions.
method Geometric methods using Hessian metrics and symmetric spaces.
result Explicit solutions and a family of non-generic solutions with applications in Poisson geometry and Kahler structures.
Diffeologies unify infinite-dimensional geometry and PDEs, enhancing classical function spaces.
problem Combining infinite-dimensional geometry and PDEs for optimization problems.
method Review and extension of classical function spaces and mapping spaces.
result Diffeologies provide a unified framework for evolution equations and optimization problems.
Discussing curvature flows and their applications.
problem Analyzing expanding curvature flows.
method Classical aspects of expanding curvature flows.
result First applications of curvature flows.
This research analyzes deep PDE solvers for option pricing accuracy.
problem Understanding the accuracy of deep learning methods for solving PDEs in option pricing.
method Comparative experiments with two neural network algorithms in Black--Scholes and Heston models.
result Empirical convergence rates and training times of TDGF method determined.
Bayesian methods solve complex nonlinear PDEs efficiently.
problem Solving nonlinear PDEs with high computational cost.
method Bayesian inference with approximate likelihood based on discretization.
result Probabilistic uncertainty quantification for PDE solutions is feasible.
A framework for reducing PDEs by symmetry, preserving key structures.
problem Reducing PDEs while preserving geometric structures and symmetries.
method Systematic calculation of reduced forms for various geometric structures.
result Noether's theorem is inherited in reduced systems, preserving conservation laws.
Toolbox for stochastic Euler equations using Ebin-Marsden theory.
problem Applying geometric framework to stochastic PDEs.
method Combining infinite-dimensional geometry and stochastic analysis.
result Local well-posedness of maximal solutions for incompressible Euler equation with noise.
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.
We develop DTs for PDE models using KL-NN and TL, analyzing TL's moment equations and one-shot learning for exactness.
problem Creating accurate digital twins for systems governed by PDEs under changing conditions.
method We use KL-NN surrogate models and transfer learning to construct DTs, analyzing the moment equations and proposing one-shot and few-shot learning methods.
result For linear PDEs, one-shot TL is exact; for nonlinear PDEs, some parameters can be transferred with minimal error.
Study methods to recover unknown processes in PDEs from data.
problem Identifying unknown processes in time-dependent PDEs using observational data.
method Theoretical analysis and numerical approaches including Galerkin and collocation algorithms.
result The Galerkin algorithm is more suitable for practical situations with noisy data.
We present a framework for recovering/approximating unknown time-dependent partial differential equation (PDE) using its solution data. Instead of identifying the terms in the underlying PDE, we seek to approximate the evolution operator of the underlying PDE numerically. The evolution operator of the PDE, defined in i…
This work presents a geometrical formulation of the Clairin theory of conditional symmetries for higher-order systems of partial differential equations (PDEs). We devise methods for obtaining Lie algebras of conditional symmetries from known conditional symmetries, and unnecessary previous assumptions of the theory are…
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.
Novel method for shape optimization of non-smooth PDEs.
problem Optimizing shapes governed by non-smooth PDEs.
method Functional variational approach and sensitivity analysis.
result Necessary conditions for locally optimal shapes.
A model order reduction framework reduces financial risk analysis models efficiently.
problem Simulating high-dimensional financial risk models.
method Adaptive greedy sampling based on POD and surrogate modeling.
result Reduced models provide significant speedup with excellent accuracy.
We study the semilinear partial differential equation (PDE) associated with the non-linear BSDE characterizing buyer's and seller's XVA in a framework that allows for asymmetries in funding, repo and collateral rates, as well as for early contract termination due to counterparty credit risk. We show the existence of a …
Random neural nets learn Black-Scholes PDEs without dimensionality issues.
problem Learning Black-Scholes type PDEs efficiently in high dimensions.
method Random feature neural networks applied to Kolmogorov PDEs.
result Random neural nets avoid the curse of dimensionality for Black-Scholes PDEs.
New framework uses PDE for no-regret generative modeling.
problem Developing efficient generative models for complex distributions.
method Iterative refinement of Brenier maps using mirror gradient descent.
result Converges to optimal Brenier map under various step-size schedules.
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.
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…
Partial differential equations (PDEs) are indispensable for modeling many physical phenomena and also commonly used for solving image processing tasks. In the latter area, PDE-based approaches interpret image data as discretizations of multivariate functions and the output of image processing algorithms as solutions to…
Recent work has introduced a simple numerical method for solving partial differential equations (PDEs) with deep neural networks (DNNs). This paper reviews and extends the method while applying it to analyze one of the most fundamental features in numerical PDEs and nonlinear analysis: irregular solutions. First, the S…
We study the general model of self-financing trading strategies in illiquid markets introduced by Schoenbucher and Wilmott, 2000. A hedging strategy in the framework of this model satisfies a nonlinear partial differential equation (PDE) which contains some function g(alpha). This function is deep connected to an utili…
New method uses Gaussian processes to improve PDE solver accuracy.
problem Uncertainty in PDE solver parameters and measurements.
method Physics-informed Gaussian process regression.
result Strictly generalizes weighted residual methods.
FunDPS improves PDE solution recovery from sparse data.
problem Recovering whole solutions from sparse or noisy measurements in PDEs.
method Function-space diffusion model with gradient-based guidance.
result FunDPS achieves 32% accuracy improvement over state-of-the-art methods.
New method detects changepoints in PDEs using optimized neural networks.
problem Detecting changepoints in PDEs with unknown locations and times.
method Online optimized Physics-Informed Neural Networks (PINNs) with Total-Variation penalty.
result Improved parameter estimation and model fitting with changepoints.
Study generalizes Picard iteration for nonlinear PDEs, deriving bounds on error.
problem Generalize Picard iteration for nonlinear parabolic PDEs.
method Formulate Picard iteration as abstract state-transition model, derive generalization error bounds.
result Picard depth reduction reduces Picard truncation error without increasing estimation error.
Survey on recent developments in isometric immersions using PDE techniques.
problem Analyzing isometric immersions with low Sobolev regularity.
method Compensated compactness and Coulomb-Uhlenbeck gauges.
result Weak continuity and stability of Gauss-Codazzi-Ricci equations.
Study on geodesic distances on SE(3)/SO(2) in machine learning.
problem Investigating the efficiency of computationally efficient sections in selecting geodesic distances.
method Analyzing geodesic distances on reductive homogeneous spaces, proving the efficiency of minimal distance sections.
result Minimal distance sections are not always geodesic minimizers, but minimal horizontal geodesics are.
Study analyzes error in neural network solving PDEs, providing convergence and error bounds.
problem Error analysis of neural network solving PDEs.
method Three-layer tanh neural network with projected gradient descent (PGD).
result Comprehensive error analysis including approximation, generalization, and optimization errors.
New framework establishes positivity of DNTK for PINNs.
problem Establishing positivity of NTK for PINNs with multiple differential operators.
method Proposed Differential Neural Tangent Kernel (DNTK) for PINNs.
result Positivity of infinite width DNTK for various activation functions and differential operators.
For the purpose of understanding second-order scalar PDEs and their hydrodynamic integrability, we introduce G-structures that are induced on hypersurfaces of the space of symmetric matrices (interpreted as the fiber of second-order jet space) and are defined by non-degenerate scalar second-order-only (Hessian) PDEs in…
A new method infers parameters from PDEs using Gaussian processes.
problem Estimating unknown parameters in PDEs from noisy data.
method PDE-Informed Gaussian Process (PIGP) method.
result The method bypasses numerical solvers for PDEs and provides uncertainty quantification.
A general method for analytic inversion in integral geometry is proposed. All classical and some new reconstruction formulas of Radon-John type are obtained by this method. No harmonic analysis and PDE is used.
This work analyzes PINNs for advection-diffusion equations using NTK theory.
problem Understanding and resolving the training difficulties of PINNs for advection-diffusion equations.
method Neural Tangent Kernel (NTK) analysis of PINNs for the linear advection-diffusion equation (LAD).
result PINNs struggle due to spectral bias and convergence rate disparity, especially in advection-dominated and diffusion-dominated regimes.
RS-PINN uses randomized smoothing to speed up high-dimensional PDE simulations without sacrificing accuracy.
problem High computational cost and bias in PINNs for high-dimensional PDEs.
method Introduces Gaussian noise for stochastic smoothing of PINNs, enabling Monte Carlo derivative approximation.
result Proposes bias correction techniques and a hybrid method to optimize the bias-variance trade-off.