Numerical Smoothing with Hierarchical Adaptive Sparse Grids and Quasi-Monte Carlo Methods for Efficient Option Pricing

by   Christian Bayer, et al.

When approximating the expectation of a functional of a stochastic process, the efficiency and performance of deterministic quadrature methods, such as sparse grid quadrature and quasi-Monte Carlo (QMC) methods, may critically depend on the regularity of the integrand. To overcome this issue and reveal the available regularity, we consider cases in which analytic smoothing cannot be performed, and introduce a novel numerical smoothing approach by combining a root finding algorithm with one-dimensional integration with respect to a single well-selected variable. We prove that under appropriate conditions, the resulting function of the remaining variables is a highly smooth function, potentially affording the improved efficiency of adaptive sparse grid quadrature (ASGQ) and QMC methods, particularly when combined with hierarchical transformations (i.e., Brownian bridge and Richardson extrapolation on the weak error). This approach facilitates the effective treatment of high dimensionality. Our study is motivated by option pricing problems, and our focus is on dynamics where the discretization of the asset price is necessary. Based on our analysis and numerical experiments, we show the advantages of combining numerical smoothing with the ASGQ and QMC methods over ASGQ and QMC methods without smoothing and the Monte Carlo approach.


page 1

page 2

page 3

page 4


Adaptive sparse grids and quasi-Monte Carlo for option pricing under the rough Bergomi model

The rough Bergomi (rBergomi) model, introduced recently in (Bayer, Friz,...

Optimal Damping with Hierarchical Adaptive Quadrature for Efficient Fourier Pricing of Multi-Asset Options in Lévy Models

Efficient pricing of multi-asset options is a challenging problem in qua...

Preintegration is not smoothing when monotonicity fails

Preintegration is a technique for high-dimensional integration over d-di...

Generating drawdown-realistic financial price paths using path signatures

A novel generative machine learning approach for the simulation of seque...

Theory and construction of Quasi-Monte Carlo rules for option pricing and density estimation

In this paper we propose and analyse a method for estimating three quant...

Solving Dynamic Discrete Choice Models Using Smoothing and Sieve Methods

We propose to combine smoothing, simulations and sieve approximations to...

On approximating the shape of one dimensional functions

Consider an s-dimensional function being evaluated at n points of a low ...

Please sign up or login with your details

Forgot password? Click here to reset