Low-rank tensor approximation for Chebyshev interpolation in parametric option pricing
From MaRDI portal
Abstract: 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. [14] propose a complexity reduction technique for parametric option pricing based on Chebyshev interpolation. As the number of parameters increases, however, this method is affected by the curse of dimensionality. In this article, we extend this approach to treat high-dimensional problems: Additionally exploiting low-rank structures allows us to consider parameter spaces of high dimensions. The core of our method is to express the tensorized interpolation in tensor train (TT) format and to develop an efficient way, based on tensor completion, to approximate the interpolation coefficients. We apply the new method to two model problems: American option pricing in the Heston model and European basket option pricing in the multi-dimensional Black-Scholes model. In these examples we treat parameter spaces of dimensions up to 25. The numerical results confirm the low-rank structure of these problems and the effectiveness of our method compared to advanced techniques.
Recommendations
- Efficient Hierarchical Approximation of High‐Dimensional Option Pricing Problems
- Chebyshev interpolation for parametric option pricing
- LATTICE OPTION PRICING BY MULTIDIMENSIONAL INTERPOLATION
- Higher-order interpolated lattice schemes for multidimensional option pricing problems
- The deep parametric PDE method and applications to option pricing
Cites work
- A closed-form solution for options with stochastic volatility with applications to bond and currency options
- A literature survey of low-rank tensor approximation techniques
- A practical introduction to tensor networks: Matrix product states and projected entangled pair states
- A reduced basis for option pricing
- AAD and least-square Monte Carlo: fast Bermudan-style options and XVA Greeks
- ADI schemes for pricing American options under the Heston model
- Algorithm 862
- Application of operator splitting methods in finance
- Approximation rates for the hierarchical tensor format in periodic Sobolev spaces
- Certified reduced basis methods for parametrized partial differential equations
- Chebfun in Three Dimensions
- Chebyshev interpolation for parametric option pricing
- Computational methods for quantitative finance. Finite element methods for derivative pricing
- Dimension-wise integration of high-dimensional functions with applications to finance
- Finite difference methods in financial engineering. A partial differential approach. With CD-ROM
- Hierarchical tensor approximation of output quantities of parameter-dependent PDEs
- High-performance computing in finance. Problems, methods, and solutions
- scientific article; zbMATH DE number 1999206 (Why is no real title available?)
- scientific article; zbMATH DE number 5489257 (Why is no real title available?)
- Kolmogorov widths and low-rank approximations of parametric elliptic PDEs
- Low-rank tensor completion by Riemannian optimization
- Low-rank tensor Krylov subspace methods for parametrized linear systems
- Multilevel Monte Carlo for exponential Lévy models
- Numerical methods for Lévy processes
- Preconditioned low-rank Riemannian optimization for linear systems with tensor product structure
- Quasi-Monte Carlo methods with applications in finance
- Reduced basis methods for partial differential equations. An introduction
- Reduced basis methods for pricing options with the Black-Scholes and Heston models
- Riemannian optimization for high-dimensional tensor completion
- Smoothing the payoff for efficient computation of Basket option prices
- Sparse grid quadrature in high dimensions with applications in finance and insurance
- Stochastic approximation schemes for economic capital and risk margin computations
- Tensor Decompositions and Applications
- Tensor numerical methods in scientific computing
- Tensor spaces and numerical tensor calculus
- Tensor-sparsity of solutions to high-dimensional elliptic partial differential equations
- Tensor-structured Galerkin approximation of parametric and stochastic elliptic PDEs
- Tensor-train decomposition
- Wavelet Galerkin pricing of American options on Lévy driven assets
Cited in
(11)- Chebyshev interpolation for parametric option pricing
- The deep parametric PDE method and applications to option pricing
- Sparse grid method for highly efficient computation of exposures for xVA
- Improved error bound for multivariate Chebyshev polynomial interpolation
- Efficient Hierarchical Approximation of High‐Dimensional Option Pricing Problems
- Black Box Approximation in the Tensor Train Format Initialized by ANOVA Decomposition
- Pricing High-Dimensional Bermudan Options with Hierarchical Tensor Formats
- Low-rank optimization on Tucker tensor varieties
- Neural optimal stopping boundary
- A priori analysis of a tensor ROM for parameter dependent parabolic problems
- On exponential convergence of Chebyshev polynomial approximation for multivariate analytic functions
This page was built for publication: Low-rank tensor approximation for Chebyshev interpolation in parametric option pricing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5131414)
