New formula for portfolio risk management using conditional PDEs.
problem Optimal diversification and risk management of portfolios.
method Closed-form formula for conditional probability, Gaussian copulas, conditional risk-neutral PDE.
result Dynamic monitoring of portfolio volatilities and weights from PDEs.
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…
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.
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.
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.
Neural-PDE learns PDEs from data using LSTM, outperforming traditional methods.
problem Solving time-dependent PDEs numerically is challenging.
method Bidirectional LSTM encoder to learn governing rules from data.
result Neural-PDE efficiently predicts PDE dynamics with minimal parameters.
Develops deep learning methods for non-linear PDEs in credit risk.
problem Solving option XVA pricing problems with non-linear PDE models.
method Boundary-safe PINNs approach, using automatic differentiation.
result Eliminates heuristic boundary condition weights, improves accuracy.
BEKAN uses RBFs and evolutionary methods to solve PDEs with boundary conditions.
problem Enforcing boundary conditions in neural networks for PDE solutions.
method Boundary condition-guaranteed evolutionary Kolmogorov-Arnold Network (BEKAN) with radial basis functions (RBFs). Incorporates Dirichlet, periodic, and Neumann conditions.
result BEKAN outperforms MLP and B-splines KAN in solving PDEs with boundary conditions.
Deep NURBS improves PINNs for solving PDEs on arbitrary geometries.
problem Solving partial differential equations on complex geometries with physics constraints.
method Combines admissible NURBS parametrizations and PINN solver for arbitrary geometries.
result High convergence rate and accuracy for most PDEs using Deep NURBS.
It is shown that the characteristic vector field associated to a first order PDE has the same form of an infinitesimal generator of an odd-symplectic transformation with contact Hamiltonian the given PDE. It is considered under which condition such PDE has a characteristic vector field commuting with a generator of an …
Enhances neural network solvers for PDEs with complex boundary conditions.
problem Challenges in solving PDEs with high accuracy and complex boundary conditions.
method Integrates natural gradient optimization with numerical time-stepping schemes to enforce Dirichlet boundary conditions.
result Superior accuracy and computational efficiency of the proposed methods for solving PDEs.
As is known, an option price is a solution to a certain partial differential equation (PDE) with terminal conditions (payoff functions). There is a close association between the solution of PDE and the solution of a backward stochastic differential equation (BSDE). We can either solve the PDE to obtain option prices or…
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.
Neural IVP solves IVPs with neural networks, overcoming scaling and conditioning issues.
problem Solving initial value PDEs with neural networks is challenging due to numerical errors and limited scalability.
method Developed an ODE-based approach to solve IVPs with neural networks, preventing ill-conditioning and scaling issues.
result Neural IVP solves challenging PDEs with neural networks efficiently and accurately.
Bayesian PINNs learn elliptic PDEs with near-minimax posterior contraction rate.
problem Learning elliptic PDEs with noisy data and non-homogeneous boundary conditions.
method Bayesian approach with a Hölder space prior on neural network weights.
result Posterior contracts at near-minimax rate without prior knowledge of solution smoothness.
We discuss various compatibility criteria for overdetermined systems of PDEs generalizing the approach to formal integrability via brackets of differential operators. Then we give sufficient conditions that guarantee that a PDE possessing a Lie algebra of symmetries has invariant solutions with respect to this Lie alge…
Derives new equations for stochastic volatility models.
problem Modeling local-stochastic-volatility models and their derivatives.
method Conditional forward equation, Dupire stochastic PDE, rolling expiry vanilla option SPDE.
result New equations for LSV models and their derivatives.
Derives new equations for volatility models and option pricing.
problem Modeling and pricing options in local-stochastic-volatility models.
method Develops conditional forward equations and Dupire stochastic PDEs.
result Derives new SPDE for vanilla options.
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.
High-dimensional PDEs have been a longstanding computational challenge. We propose to solve high-dimensional PDEs by approximating the solution with a deep neural network which is trained to satisfy the differential operator, initial condition, and boundary conditions. Our algorithm is meshfree, which is key since mesh…
Neural Q-learning tackles high-dimensional PDEs.
problem Solving high-dimensional PDEs is computationally challenging.
method Adapting Q-learning from reinforcement learning to solve PDEs.
result The neural network approximator converges to the PDE solution as the network width increases.
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.
This article presents a new methodology called deep Theory of Functional Connections (TFC) that estimates the solutions of partial differential equations (PDEs) by combining neural networks with TFC. TFC is used to transform PDEs with boundary conditions into unconstrained optimization problems by embedding the boundar…
PRISMA uses PDE residuals for fast, robust, and accurate inference.
problem Slow gradient-based optimization and instability in PDE residual-based methods.
method Integrates PDE residuals directly into the model's architecture via attention mechanisms in the spectral domain.
result Competitive accuracy with significantly lower inference costs and faster speeds.
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.
New integrable matrix PDEs derived from Frölicher-Nijenhuis brackets.
problem Developing integrable systems from tensor field properties.
method Using Frölicher-Nijenhuis brackets to generate bi-differential graded algebras and PDE systems.
result New integrable nonlinear matrix PDEs and systems are derived.
Study of nonlinear PDEs using derived geometry and BV formalism.
problem Understanding non-linear PDEs via derived geometric methods.
method Derived enhancement of de Rham complex, algebro-geometric techniques, BV formalism.
result Natural derived enhancement of de Rham complex for nonlinear PDEs.
Study rough volatility models using path-dependent PDEs and fractional Brownian motions.
problem Modeling and analyzing rough volatility in financial markets.
method Showed conditional expectations are unique classical solutions to path-dependent PDEs derived from functional Itô formula. Leverage these to study weak rates of convergence for discretized stochastic integrals.
result Obtained optimal weak error rates for approximating log-stock prices in rough volatility models.
The paper classifies Finsler surfaces satisfying the T-condition or σT-condition.
problem Characterizing Finsler surfaces based on specific tensor conditions.
method Analyzing Finsler surfaces in dimensions n≥3, proving conditions equivalence, and solving PDEs.
result All Finsler surfaces satisfying the T-condition or σT-condition are classified.
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.
A new principle minimizes residual and introduces momentum to improve PDE solution dynamics.
problem Ill-conditioning in Dirac-Frenkel residual minimization leads to non-unique parameter dynamics.
method Introduces a history variable (momentum) to select better-conditioned parameter velocities, preserving residual minimization while promoting smooth parameter evolutions.
result The approach leads to increased robustness in singular and near-singular PDE solution regimes.
Path-dependent PDEs model VIX and Realised Variance options.
problem Modeling volatility derivatives with path-dependence.
method Continuous stochastic volatility model with Gaussian Volterra process, proving well-posedness of PDEs.
result Formulae for greeks and implied volatility provided, finite-dimensional pricing PDEs obtained in Markovian models.
We derive a backward and forward nonlinear PDEs that govern the implied volatility of a contingent claim whenever the latter is well-defined. This would include at least any contingent claim written on a positive stock price whose payoff at a possibly random time is convex. We also discuss suitable initial and boundary…
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 PDE systems generalize Hawking mass monotonicity.
problem Generalizing Hawking mass monotonicity to initial data sets.
method Introduced new systems of PDE on initial data sets (M,g,k). result Generalized Geroch's monotonicity formula to initial data sets.
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.
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.
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.
Study on PDEs in Heston model with unique solution and convergence proof.
problem Analyzing PDEs in the Heston model for financial applications.
method Regularity results, verification theorem, unique viscosity solution, convergence proof.
result Unique viscosity solution for wide initial and source data.
Study of Killing spinor-valued forms and their integrability conditions.
problem Understanding Killing spinor-valued forms and their properties.
method Detailed treatment of prolongation and integrability conditions, relating to curvature of the manifold.
result New solutions found that are not from tensor products of Killing spinors and Killing-Yano forms.
New method recovers PDEs from noisy data, even when conditions are violated.
problem Discovering PDEs from noisy, limited data.
method Randomized adaptive Lasso integrated into DeepMod.
result Recovery of PDEs with higher noise-to-sample ratios and single hyperparameters.
Unified framework solves nonlinear PDEs and IPs using Gaussian processes.
problem Solving and identifying parameters in nonlinear PDEs and inverse problems.
method Gaussian process framework approximating solutions as MAP estimators, reducing to finite-dimensional optimization problem.
result Unified method converges in a small number of iterations for various PDEs.
The paper finds surfaces closest to being flat that span a given contour.
problem Finding surfaces in R3 that are as flat as possible while spanning a given contour. method The approach involves minimizing the total Gaussian curvature squared and solving a system of PDEs.
result The optimal surface is shown to be controlled by a biharmonic equation with specific boundary conditions.
This work introduces a new loss function to improve the efficiency of optimization-based PDE solvers.
problem Optimization-based PDE solvers converge slowly and are inefficient compared to classical iterative solvers.
method Proposes a novel Stabilized Gradient Residual (SGR) loss function to modulate the condition number.
result The SGR loss achieves orders-of-magnitude faster convergence than the MSE loss in both ODIL and PINNs frameworks.
The paper examines the neural tangent kernel for PINNs solving general PDEs and finds convergence conditions.
problem Analyzing the convergence of neural tangent kernel for PINNs solving general PDEs.
method Analysis of NTK initialization and convergence during training for general PDEs using PINNs.
result Homogeneity of differential operators is crucial for NTK convergence.
PANIS learns PDE surrogates for heterogeneous materials without solving the PDE.
problem Learning surrogates for parametrized PDEs in heterogeneous media.
method Physics-aware neural implicit solvers combining probabilistic learning and physics-informed discretization.
result Learned surrogates for effective solutions in heterogeneous materials without solving the reference problem.
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.
By studying the development of shock waves out of discontinuity waves, in 1954 P. Lax discovered a class of PDEs, which he called 'completely exceptional', where such a transition does not occur after a finite time. A straightforward integration of the completely exceptionality conditions allowed Boillat to show that s…