Efficiently price high-dimensional Bermudan options using tensor compression.
problem High-dimensional option pricing with computational complexity.
method Hierarchical tensor compression for Monte Carlo and dual martingale methods.
result Tensor compression alleviates the curse of dimensionality for Bermudan option pricing.
New method optimizes portfolios with options, addressing asymmetry, dimensionality, and dependence.
problem Optimizing portfolios with options, especially when distributions are asymmetric, dimensions are high, and payoffs are dependent.
method Developed a new dependency matrix based on conditional probabilities of options' payoffs, computed using copula structures.
result Empirical evidence shows the approach is efficient, fast, and scalable to large portfolios of options.
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.
A new method uses Gaussian processes and deep kernel learning to price high-dimensional American options efficiently.
problem Challenges in pricing high-dimensional American options, especially with excessive computational costs.
method Modified Gaussian process regression with deep kernel learning and sparse variational Gaussian processes.
result The method outperforms least squares Monte Carlo in high-dimensional scenarios, especially with Merton's jump diffusion model.
Deep BSDE method for pricing and hedging complex financial portfolios.
problem Simultaneous pricing and delta-gamma hedging of large portfolios of multi-asset Bermudan options.
method Discretely reflected BSDEs, One Step Malliavin scheme, neural network regression Monte Carlo method.
result Efficient and accurate pricing and hedging strategies for high-dimensional portfolios.
Paper uses ML for high-dimensional option pricing under uncertain volatility model.
problem High-dimensional option pricing under uncertain volatility.
method Two ML approaches: GTU and NNU.
result Significant improvement in option pricing precision.
Nowadays many financial derivatives, such as American or Bermudan options, are of early exercise type. Often the pricing of early exercise options gives rise to high-dimensional optimal stopping problems, since the dimension corresponds to the number of underlying assets. High-dimensional optimal stopping problems are,…
KANHedge improves hedging of high-dimensional options using learnable B-spline activation functions.
problem Challenges in high-dimensional option pricing and hedging due to the curse of dimensionality.
method Introduces KANHedge, a novel BSDE-based hedger leveraging Kolmogorov-Arnold Networks with learnable B-spline activation functions.
result KANHedge provides improved hedging performance, achieving significant reductions in hedging cost metrics.
The options framework in reinforcement learning models the notion of a skill or a temporally extended sequence of actions. The discovery of a reusable set of skills has typically entailed building options, that navigate to bottleneck states. This work adopts a complementary approach, where we attempt to discover option…
Randomized neural networks improve exposure and CVA estimation for American options.
problem Estimation of exposure and CVA for American options
method Randomized neural networks
result Improves convergence and efficiency in high-dimensional problems
The paper solves the skewness problem in high-dimensional basket options.
problem Inconsistent skewness between individual stock options and basket options on an index.
method Developed an effective local volatility model and calibrated the basket to the index smile using a jump-diffusion model.
result The method resolves the skewness issue, matching the index smile in basket option prices.
Quantum computing improves Monte Carlo option pricing for complex derivatives.
problem Complex financial derivatives require extensive computations in high-dimensional spaces.
method Developed a quantum algorithm for simulating many potential asset paths in parallel.
result Quantum algorithm provides highly accurate option pricing and risk analysis.
Efficient method for pricing Bermudan moving average options using GPR-GHQ.
problem High-dimensional pricing of Bermudan moving average options in energy markets.
method Gaussian Process Regression and Gauss-Hermite quadrature.
result GPR-GHQ method efficiently handles long windows and high dimensionality.
Simulates multi-asset spot and option markets using normalizing flows.
problem High-dimensionality of market call prices and dynamic preservation across simulators.
method Normalizing flows for efficient low-dimensional representations, conditional invertibility for joint distribution calibration.
result Calibrated simulators maintain dynamics of each underlying and accurately represent market call prices.
Deep neural networks approximate option prices in high-dimensional Lévy models efficiently.
problem Approximating option prices in high-dimensional financial models with jumps.
method Use of deep ReLU neural networks to approximate option prices in multivariate Lévy processes with polynomial growth in network size and dimension.
result Established sufficient conditions for polynomial growth in network size and dimension to approximate option prices with error ε.
Deep learning solves barrier options with stochastic volatility.
problem Solving barrier options with stochastic volatility.
method Unsupervised deep learning neural networks trained to satisfy PDE and boundary conditions.
result Neural networks accurately price barrier options in a single framework.
Paper offers a simpler solution for managing complex financial options.
problem Managing a large number of financial assets with diverse dynamics.
method Developed a simple analytical approximation for market making.
result Shows significant flexibility over existing market making strategies.
Quantum computing speeds up option pricing for multiple assets.
problem High-dimensional integration bottleneck in option pricing.
method Calibrated marginal distributions, Gaussian copula, QAMC with QAE.
result QAMC reduces integration queries by 10-100 times for similar precision.
Efficient method for high-dimensional American option pricing and hedging.
problem High-dimensional American option pricing and hedging.
method Gradient-enhanced sparse Hermite polynomial expansions combined with least squares Monte Carlo.
result Outperforms state-of-the-art methods in high dimensions with comparable computational cost.
A new deep learning method for option pricing in rough volatility models.
problem Efficient pricing of European options in high-dimensional rough volatility models.
method Time-stepping deep gradient flow method reformulating the option pricing PDE as an energy minimization problem.
result The method respects asymptotic behavior and known bounds for option prices.
ANNs solve financial option valuation problems without numerical methods.
problem Valuation of European and American financial options.
method Unsupervised learning with artificial neural networks (ANNs) for solving PDEs.
result ANNs accurately compute option values for various stock scenarios.
Tensor trains speed up option pricing for multi-asset options.
problem Speeding up option pricing for multi-asset options.
method Tensor train learning algorithms to compress functions with parameter dependence.
result The proposed method outperforms Monte Carlo-based pricing in computational complexity.
In this article, we tackle the problem of a market maker in charge of a book of options on a single liquid underlying asset. By using an approximation of the portfolio in terms of its vega, we show that the seemingly high-dimensional stochastic optimal control problem of an option market maker is in fact tractable. Mor…
A new method solves complex financial problems using deep learning.
problem Optimal stopping and option pricing in finance.
method Compound BSDE method, based on reformulating BSDEs.
result The method offers accurate and efficient solutions for high-dimensional problems.
Treating high dimensionality is one of the main challenges in the development of computational methods for solving problems arising in finance, where tasks such as pricing, calibration, and risk assessment need to be performed accurately and in real-time. Among the growing literature addressing this problem, Gass et al…
New method for option pricing using Monte Carlo and least squares.
problem Computing European option prices in high dimensions.
method Combines Monte Carlo simulation with least squares approximation and randomized Kaczmarz algorithm.
result Efficient method for high-dimensional integration and option pricing.
Deep neural network approximates multivariate option pricing.
problem High-dimensional partial differential equations in option pricing.
method Deep parametric PDE method using neural networks.
result Option prices computed in milliseconds for up to 25 dimensions.
Pricing of high-dimensional options is one of the most important problems in Mathematical Finance. The objective of this manuscript is to present an original self-contained treatment of the multidimensional pricing. During the past decades the Black-Scholes this model, which essentially is based on the log-normal assum…
Deep learning models price options using volatility surfaces.
problem Pricing exotic options with high accuracy and efficiency.
method Variational autoencoder for volatility surface compression, multilayer perceptron for option pricing.
result Trained model achieves high accuracy across American and Asian options.
A hybrid framework prices options using neural networks and VAE latent space.
problem Lack of explicit asset dynamics information in compressed volatility surfaces.
method Combining Weighted Monte Carlo with neural networks trained on VAE latent space.
result Effective pricing of vanilla and exotic options on idealized vol surface.
Deep RNNs compute American option prices and deltas efficiently.
problem Computing prices and deltas of high-dimensional American options.
method Two deep RNNs, one for price and one for delta, learn over spacetime.
result Linear time and constant memory cost compared to feedforward networks.
New method uses neural networks for optimal stopping time problems.
problem Optimal stopping time problems in high-dimensional financial models.
method Neural networks and randomisation of discrete variables for direct policy modeling.
result Success in pricing high-dimensional American and swing options.
Option discovery and skill acquisition frameworks are integral to the functioning of a Hierarchically organized Reinforcement learning agent. However, such techniques often yield a large number of options or skills, which can potentially be represented succinctly by filtering out any redundant information. Such a reduc…
RL accelerates portfolio optimization and option pricing by dynamically adjusting preconditioner sizes.
problem Large linear systems in portfolio optimization and option pricing lead to slow convergence.
method Reinforcement Learning (RL) dynamically adjusts block-preconditioner sizes to accelerate convergence.
result RL-driven solver significantly reduces computational cost and accelerates convergence.
American put options are among the most frequently traded single stock options, and their calibration is computationally challenging since no closed-form expression is available. Due to the higher flexibility in comparison to European options, the mathematical model involves additional constraints, and a variational in…
Deep Penalty Method solves high-dimensional optimal stopping problems using deep learning.
problem High-dimensional optimal stopping problems in American option pricing.
method Inspired by penalty method for PDEs, approximates penalized PDE with Deep BSDE framework.
result Error bound of DPM is O ( 1 λ ) + O ( λ h ) + O ( h ) O(\frac{1}{\lambda}) + O(\lambda h) + O(\sqrt{h}) O ( λ 1 ) + O ( λh ) + O ( h ) . ETCNN uses neural networks to price American options accurately.
problem Accurately pricing American options with inequality constraints.
method ETCNN framework solving BSM equations with exact terminal condition.
result ETCNN achieves high accuracy and robustness across various scenarios.
New method uses tensor networks to price multi-asset options efficiently.
problem Pricing multi-asset options via classical full-grid solvers is computationally infeasible due to the curse of dimensionality.
method Quantized tensor trains (QTT) transform the d-asset Black-Scholes PDE into a tractable high-dimensional problem.
result Full-grid prices and Greeks for correlated basket and max-min options in three to five dimensions can be computed with high accuracy.
LCD improves causal discovery in high-dimensional gene data.
problem Predicting causal effects in large-scale gene expression data.
method Local Causal Discovery (LCD) with practical estimators, ICP algorithm inspiration, preselection method, and statistical tests.
result LCD estimator closely matches ICP's accuracy but is simpler and faster.
Combines additivity and active subspaces for high-dimensional Gaussian process modeling.
problem High-dimensional Gaussian process modeling challenges due to the curse of dimensionality.
method Combines additivity and active subspaces with a multi-fidelity strategy.
result Shows advantages through experiments on synthetic functions and datasets.
Study uses neural networks to improve option pricing accuracy.
problem Reducing variance in Monte Carlo estimators for option pricing.
method Characterizes neural networks' universal approximation property and applies it to sampling measures.
result Sampling measures generated by neural networks can approximate optimal measures arbitrarily well.
Pricing of high-dimensional options is a deep problem of the Theoretical Financial Mathematics. In this article we present a new class of Lévy driven models of stock markets. In our opinion, any market model should be based on a transparent and intuitively easily acceptable concept. In our case this is a linear system …
New method smooths integrands for efficient option pricing.
problem Improving numerical performance of option pricing methods.
method Combining hierarchical adaptive sparse grids, quasi-Monte Carlo, and numerical smoothing.
result Improved efficiency of ASGQ and QMC methods for high-dimensional problems.
We propose a new forward-backward stochastic differential equation solver for high-dimensional derivatives pricing problems by combining deep learning solver with least square regression technique widely used in the least square Monte Carlo method for the valuation of American options. Our numerical experiments demonst…
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.
Deep learning approximates Bermudan option exposures and future values.
problem Computing accurate expected and future exposures for high-dimensional Bermudan options.
method Neural network-based approach combining Deep Optimal Stopping and regression.
result Neural network approximations of pathwise option values are more accurate.
New deep learning method for option pricing in jump-diffusion models.
problem Option pricing in jump-diffusion models with high-dimensional assets.
method Implicit-explicit minimizing movement time-stepping approach using deep ANNs.
result Consistent and asymptotically correct solutions for large underlyings.
In this paper we propose two efficient techniques which allow one to compute the price of American basket options. In particular, we consider a basket of assets that follow a multi-dimensional Black-Scholes dynamics. The proposed techniques, called GPR Tree (GRP-Tree) and GPR Exact Integration (GPR-EI), are both based …