Paper uses deep learning to solve PDEs without supervision.
problem Solving elliptic PDEs without labeled data.
method Uses deep neural networks and least-squares functionals.
result Demonstrates effectiveness on 1D second-order elliptic PDEs.
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
168,982 papers · 148 categories
Trend · papers per month
48 results for “numerical PDE”
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.
Partial differential equations (PDEs) are commonly derived based on empirical observations. However, recent advances of technology enable us to collect and store massive amount of data, which offers new opportunities for data-driven discovery of PDEs. In this paper, we propose a new deep neural network, called PDE-Net …
Develops numerical methods for PDEs on hypergraphs and networks.
problem Solving PDEs on complex geometric structures like hypergraphs and networks.
method Hybrid finite element methods, focusing on hybrid discontinuous Galerkin methods.
result Derives numerical approximations for PDEs on hypergraphs and networks.
New method reduces PDE surrogate model training costs by selectively acquiring time steps.
problem High computational cost of generating training data for PDE surrogate models.
method STAP (Selective Time-Step Acquisition for PDEs) framework that acquires only important time steps.
result Demonstrated effectiveness on several benchmark PDEs, reducing training costs.
Stochastic differential equations (SDEs) and the Kolmogorov partial differential equations (PDEs) associated to them have been widely used in models from engineering, finance, and the natural sciences. In particular, SDEs and Kolmogorov PDEs, respectively, are highly employed in models for the approximative pricing of …
Paper solves PDEs for optimal investment strategies in volatile markets.
problem Finding optimal investment strategies in volatile markets.
method Numerical methods using time-changed Bessel bridges.
result Solves PDEs for relative arbitrage opportunities in volatility-stabilized markets.
Space mapping speeds up shape optimization for PDEs.
problem Efficiently solving shape optimization problems constrained by PDEs.
method Combines fine and coarse model optimizations using Riemannian metrics.
result Space mapping methods are highly efficient for complex shape optimization problems.
New methods improve deep learning for solving linear PDEs.
problem Efficiently solving high-dimensional linear PDEs using deep learning.
method Rigorous investigation of gradient estimators for SDE-based variational formulations.
result Novel methods provide substantial performance improvements.
Develops a numerical scheme for solving path-dependent FBSDEs and PDEs.
problem Solving path-dependent FBSDEs and PDEs numerically.
method Picard iteration method for FBSDEs, concentration inequality for estimator, supervised learning with neural networks for PDEs.
result Proves convergence and rate of convergence for the Picard iteration method.
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.
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…
PDE models for the valuation of a non callable defaultable coupon bond under an extended JDCEV modelq-fin.CP
PDE models value non callable defaultable bonds under JDCEV model.
problem Valuation of non callable defaultable bonds using PDEs.
method Two PDE problems solved using Crank-Nicolson semi-Lagrangian method and bi-quadratic Lagrange finite elements.
result Agreement between PDE approach and Monte Carlo, asymptotic methods.
New algorithm uses deep learning for option pricing in rough volatility models.
problem Evaluating options in affine rough stochastic volatility models.
method Developed a numerical scheme based on deep learning for curve-dependent PDEs.
result Numerical simulations show the new method is a promising alternative to Monte Carlo simulations.
Parameter Inference based on Gaussian Processes Informed by Nonlinear Partial Differential Equationsmath.NA
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.
Improved neural PDEs trained on augmented data enhance model accuracy and efficiency.
problem Training neural PDEs on limited data to accurately represent complex systems.
method Space-filling sampling of local states to generate augmented training data.
result Data-augmented neural PDEs outperform traditional emulators in accuracy and stability.
In this paper, a standard PDE for the pricing of arithmetic average strike Asian call option is presented. A Crank-Nicolson Implicit Method and a Higher Order Compact finite difference scheme for this pricing problem is derived. Both these schemes were implemented for various values of risk free rate and volatility. Th…
PDEs for pricing interest rate derivatives under the new generalized Forward Market Model (FMM)q-fin.PR
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.
New method uses tensor trains for efficient PDE approximation.
problem High-dimensional PDEs and the curse of dimensionality.
method Tensor trains and backward stochastic differential equations for parabolic PDEs.
result Achieves a favorable trade-off between accuracy and computational efficiency.
Method solves high-dimensional nonlinear PDEs using neural networks.
problem Solving high-dimensional fully nonlinear PDEs.
method Backward induction with multi-layer neural networks to estimate solution and its gradient, with Hessian approximated by automatic differentiation.
result Method extends previous work on semi-linear PDEs to fully nonlinear cases, demonstrating accuracy on various examples.
LR-EDNN reduces PDE solver complexity by limiting network weights to low-rank subspace.
problem Efficiently solving time-dependent PDEs with deep neural networks.
method Low-rank constraint on network weights using SVD for efficient parameter updates.
result LR-EDNN achieves comparable accuracy to full EDNN with fewer parameters and lower cost.
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.
Artificial neural networks (ANNs) have very successfully been used in numerical simulations for a series of computational problems ranging from image classification/image recognition, speech recognition, time series analysis, game intelligence, and computational advertising to numerical approximations of partial differ…
Develops a new solver for path-dependent PDEs using signature kernels.
problem Solving path-dependent PDEs (PPDEs) efficiently and accurately.
method Uses signature kernels to solve PPDEs by approximating the solution with minimal norm in a reproducing kernel Hilbert space.
result Proves the consistency of the numerical scheme, ensuring convergence to PPDE solutions as the number of collocation points increases.
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.
New deep learning methods solve symmetric PDEs efficiently.
problem Solving nonlinear symmetric PDEs in high dimensions.
method Design of PointNet and DeepSet neural networks.
result DeepSet networks provide more accurate solutions and gradients.
Scalable solver reduces PDE uncertainty with active learning.
problem High computational cost in solving PDEs.
method Stochastic dual descent and clustering-based active learning.
result Solver scales to large number of collocation points.
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.
New method combines deep learning and splitting for high-dimensional PDEs.
problem Solving high-dimensional nonlinear parabolic PDEs efficiently.
method Combines operator splitting with deep learning for separate subproblems.
result Very good results in up to 10,000 dimensions with short run times.
Novel IMEX scheme solves financial PDEs with mixed derivatives.
problem Numerical approximations for financial PDEs with mixed derivatives.
method Second order finite volume IMEX Runge-Kutta scheme.
result Achieves true second order convergence with non-regular initial conditions.
New PDEs model implied volatility without prior knowledge.
problem Modeling implied volatility without prior knowledge.
method Derived backward and forward nonlinear PDEs, discussed initial and boundary conditions, solved numerically.
result Solved PDEs for implied volatility of positive stock price contingent claims.
The numerical solution of large-scale PDEs, such as those occurring in data-driven applications, unavoidably require powerful parallel computers and tailored parallel algorithms to make the best possible use of them. In fact, considerations about the parallelization and scalability of realistic problems are often criti…
Kernel method learns PDEs from noisy data.
problem Discovering and solving PDEs from noisy data.
method Kernel smoothing, regression, and operator learning.
result Competitive performance compared to state-of-the-art algorithms.
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…
In this work we apply the Deep Galerkin Method (DGM) described in Sirignano and Spiliopoulos (2018) to solve a number of partial differential equations that arise in quantitative finance applications including option pricing, optimal execution, mean field games, etc. The main idea behind DGM is to represent the unknown…
The paper presents a PDE method for xVA incorporation in financial derivatives.
problem Incorporating value adjustments (xVA) in financial derivative pricing.
method Analytical solution of PDEs in the Black-Scholes framework.
result New semi-closed formulas for xVA are derived and compared to Monte-Carlo and numerical methods.
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.
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.
Proposes MscaleDNN for solving high-dimensional PDEs efficiently.
problem Solving high-dimensional PDEs efficiently.
method Radial scaling in frequency domain and compact support activation functions.
result Increased power in multi-scale resolution and high frequency capturing.
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 …
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…
Nonlinear PDEs risen when solving some optimization problems in finance, and their solutionsq-fin.CP
We consider a specific type of nonlinear partial differential equations (PDE) that appear in mathematical finance as the result of solving some optimization problems. We review some existing in the literature examples of such problems, and discuss the properties of these PDEs. We also demonstrate how to solve them nume…
FiniteNet uses a neural network to improve PDE solving methods.
problem Improving accuracy in solving time-dependent PDEs.
method Fully convolutional LSTM network trained on simulation data.
result Reduces error by a factor of 2 to 3 compared to baseline methods.
The paper characterizes when numerical criteria for PDE solvability fail and provides effective criteria for existence.
problem Characterizing when numerical criteria for PDE solvability fail.
method Finite number of subvarieties violating Nakai type criterion, and their rigidity.
result Finite number of subvarieties violating the Nakai type criterion, and these subvarieties are rigid.
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.
A new method solves complex financial equations efficiently.
problem Solving worst-case and best-case prices for two-factor uncertain volatility models.
method Decompose and integrate, then optimize; piecewise constant control; closed-form Green's functions; 2D convolution integrals; monotone numerical integration; Fast Fourier Transforms.
result The method efficiently computes the value function and optimal control, converging to the viscosity solution of the HJB equation.
Paper extends neural network method to irregular solutions in PDEs.
problem Solving irregular and data-enriched PDEs.
method Deep neural networks for numerical PDE solutions, extending to irregular and data-enhanced cases.
result Demonstrates ease and integration of large datasets in PDE modeling.
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.