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…
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,657 papers · 148 categories
Trend · papers per month
48 results for “PDE techniques”
Enhances uncertainty modeling in random PDEs using PINNs and generative models.
problem Uncertainty in complex systems modeled by random PDEs.
method Combines Physics-Informed Neural Networks (PINNs) with generative modeling techniques.
result Systematic control of uncertainty with maintained predictive accuracy.
In this paper we construct a parametrization-free embedding technique for numerically evolving reaction-diffusion PDEs defined on algebraic curves that possess an isolated singularity. In our approach, we first desingularize the curve by appealing to techniques from algebraic geometry. We create a family of smooth curv…
Across numerous applications, forecasting relies on numerical solvers for partial differential equations (PDEs). Although the use of deep-learning techniques has been proposed, actual applications have been restricted by the fact the training data are obtained using traditional PDE solvers. Thereby, the uses of deep-le…
We use Vessiot theory and exterior calculus to solve partial differential equations(PDEs) of the type uyy = F(x, y,u,ux,uy,uxx,uxy) and associated evolution equations. These equations are represented by the Vessiot distribution of vector fields. We develop and apply an algorithm to find the largest integrable sub-distr…
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.
Paper develops techniques to solve complex PDEs involving higher cohomology forms.
problem Develop PDE techniques to study real (p, p) forms on Hermitian manifolds.
method Parabolic approach to establish existence of classical solutions.
result Existence of classical solutions for a large class of fully nonlinear equations.
Paper introduces a new method to solve complex PDEs efficiently.
problem Solving high-dimensional semilinear PDEs and BSDEs.
method Decomposes PDEs into linear and nonlinear parts, uses Deep BSDE solver with control variate method.
result Errors of the new method are much smaller than those of the original Deep BSDE solver.
Establish C^{1,2} regularity of American value functions in Heston model
problem Regularity of American put options in Heston model
method PDE techniques
result C^{1,2} regularity in exercise domain and smooth-fit principle
Some recent developments on isometric immersions via compensated compactness and gauge transformsmath.AP
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 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.
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.
Recent machine learning algorithms dedicated to solving semi-linear PDEs are improved by using different neural network architectures and different parameterizations. These algorithms are compared to a new one that solves a fixed point problem by using deep learning techniques. This new algorithm appears to be competit…
Sacks-Uhlenbeck's result on metric spaces expanded.
problem Existence of non-trivial harmonic 2-spheres in metric spaces.
method Developed a metric approach to generalize Sacks-Uhlenbeck's result.
result Generalized Sacks-Uhlenbeck's result to a broader class of compact metric spaces.
New method reduces PDE model parameters by 30% with sparsity.
problem Redundant parameters in neural network projections.
method Bregman iterations for sparsity, POD compression, bias propagation.
result 30% fewer parameters with similar accuracy.
Proves a conjecture about Riemann surfaces using PDEs.
problem Griffiths' conjecture on holomorphic vector bundles on compact Riemann surfaces.
method Combines techniques from Uhlenbeck-Yau and Pingali's reduction to prove a system of PDEs.
result Analytic proof of Griffiths' conjecture on compact Riemann surfaces.
We present a PDE-based framework that generalizes Group equivariant Convolutional Neural Networks (G-CNNs). In this framework, a network layer is seen as a set of PDE-solvers where geometrically meaningful PDE-coefficients become the layer's trainable weights. Formulating our PDEs on homogeneous spaces allows these net…
PDE-Foam - a probability-density estimation method using self-adapting phase-space binningphysics.data-an
Probability Density Estimation (PDE) is a multivariate discrimination technique based on sampling signal and background densities defined by event samples from data or Monte-Carlo (MC) simulations in a multi-dimensional phase space. In this paper, we present a modification of the PDE method that uses a self-adapting bi…
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.
Approximating Functional of Local Martingale Under the Lack of Uniqueness of Black-Scholes PDEq-fin.PR
When the underlying stock price is a strict local martingale process under an equivalent local martingale measure, Black-Scholes PDE associated with an European option may have multiple solutions. In this paper, we study an approximation for the smallest hedging price of such an European option. Our results show that a…
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…
Paper designs Poisson integrators using machine learning.
problem Designing integrators that preserve Poisson geometry.
method Reformulated as an optimization problem in Hamilton-Jacobi PDE, solved using machine learning.
result Machine learning approximates solutions to Hamilton-Jacobi PDE.
New quantum algorithm simplifies complex financial derivatives pricing.
problem Complex financial derivatives pricing with high dimensionality.
method Quantum-inspired variational algorithms combined with neural-network quantum states.
result Simplified pricing of European options with many correlated assets.
Study shows rate of convergence for particle approximation of PDEs in Wasserstein space.
problem Analyzing convergence rates for particle approximations of PDEs in Wasserstein space.
method Backward stochastic differential equations techniques.
result Proved a rate of convergence of order 1/N for pathwise error and 1/sqrt(N) for L2-error on the derivative.
We introduce a new deep-learning based algorithm to evaluate options in affine rough stochastic volatility models. Viewing the pricing function as the solution to a curve-dependent PDE (CPDE), depending on forward curves rather than the whole path of the process, for which we develop a numerical scheme based on deep le…
Estimates Kähler metric diameters with entropy bound alone.
problem Estimating Kähler metric diameters.
method PDE techniques for estimates of the Monge-Ampère equation, improving degeneracies.
result Diameter bounds for Kähler-Ricci flow and Calabi-Yau manifolds.
Paper solves curvature prescription problem on surfaces with boundary.
problem Prescribing Gaussian and geodesic curvatures on compact surfaces with boundary.
method Mean field-type formulation and variational techniques.
result Existence results for positive, zero, and negative Euler characteristics.
New method solves SLV models faster using Lie algebra.
problem Local stochastic volatility models.
method Wei-Norman factorization method and Lie algebraic techniques.
result Reduces time-dependent SLV models to autonomous 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.
Physics-informed deep learning for PDEs solves forward and inverse problems efficiently.
problem Solving forward and inverse problems in parametric PDEs efficiently and accurately.
method Physics-informed deep latent variable model (PDDLVM) combining deep neural networks, probabilistic modelling, and variational inference.
result Achieves up to three orders of magnitude speed-up compared to traditional FEM while providing coherent uncertainty estimates.
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.
Paper studies deep learning for solving elliptic PDEs, proving optimal bounds and neural scaling laws.
problem Solving elliptic PDEs from random samples using machine learning.
method Deep Ritz Method and Physics-Informed Neural Networks (PINNs) for the Schrödinger equation.
result Proves minimax optimal bounds and neural scaling laws for deep PDE solvers.
Applications in quantitative finance such as optimal trade execution, risk management of options, and optimal asset allocation involve the solution of high dimensional and nonlinear Partial Differential Equations (PDEs). The connection between PDEs and systems of Forward-Backward Stochastic Differential Equations (FBSD…
Paper explores solving HJB equations using neural networks.
problem Solving high-dimensional time-dependent HJB equations.
method Neural Galerkin methods with nonlinearly parametrized trial functions.
result Closed-form solutions for trial functions.
New method uses neural networks to solve complex PDEs from optimal control theory.
problem Solving high-dimensional Hamilton-Jacobi-Bellman PDEs.
method Iterative diffusion optimization techniques, focusing on path measures and divergences.
result Favourable properties of log-variance divergence for Monte Carlo estimators.
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.
Derives PDEs from data using manifold learning and neural networks.
problem Identifying PDEs from unknown variables and dynamics.
method Combines manifold learning (Diffusion Maps) and neural networks.
result Emergent space identification connects with multiscale computation.
Paper uses neural nets for financial optimization problems.
problem Financial optimization and derivative pricing problems.
method Neural networks and deep reinforcement learning for solving PDEs and dynamic optimization.
result Efficient resolution of nonlinear PDEs and dynamic optimization in finance.
In this work, we have presented a simple analytical approximation scheme for generic non-linear FBSDEs. By treating the interested system as the linear decoupled FBSDE perturbed with non-linear generator and feedback terms, we have shown that it is possible to carry out a recursive approximation to an arbitrarily highe…
New examples of solitons found using submersion techniques.
problem Finding new mean curvature solitons on manifolds.
method Riemannian submersion techniques to reduce PDE to ODE.
result New examples of rotators in hyperbolic space.
Quasi-Lie schemes for PDEsmath.AP
The theory of quasi-Lie systems, i.e. systems of first order ordinary differential equations which can be related via a generalised flow to Lie systems, is extended to systems of partial differential equations and its applications to obtaining -dependent superposition rules and integrability conditions are analysed.…
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.
New method uses LSTM and signature theory to solve complex financial PDEs.
problem Solving path-dependent PDEs for financial derivatives pricing.
method Combining LSTM networks and rough paths theory.
result Efficient algorithms for pricing and hedging path-dependent derivatives.
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.
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.
Sparsistent Model Discoverystat.ML
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.
Asians and cash dividends: Exploiting symmetries in pricing theorycond-mat.stat-mech
In this article we present new results for the pricing of arithmetic Asian options within a Black-Scholes context. To derive these results we make extensive use of the local scale invariance that exists in the theory of contingent claim pricing. This allows us to derive, in a natural way, a simple PDE for the price of …
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.