Product Markovian Quantization of a Diffusion Process with Applications to Finance

Abstract

We introduce a new approach to quantize the Euler scheme of an R d -valued diffusion process. This method is based on a Markovian and componentwise product quantization and allows us, from a numerical point of view, to speak of fast online quantization in dimension greater than one since the product quantization of the Euler scheme of the diffusion process and its companion weights and transition probabilities may be computed quite instantaneously. We show that the resulting quantization process is a Markov chain, then, we compute the associated companion weights and transition probabilities from (semi-) closed formulas. From the analytical point of view, we show that the induced quantization errors at the k-th discretization step t k is a cumulative of the marginal quantization error up to time t k . Numerical experiments are performed for the pricing of a Basket call option, for the pricing of a European call option in a Heston model and for the approximation of the solution of backward stochastic differential equations to show the performances of the method.

Quantization-based approximation of reflected BSDEs with extended upper bounds for recursive quantization

“…When the dimension becomes greater than 1, computing the distribution (grids and transition matrices) of ( X k ) 0≤k≤n via the recursive formulas (22) cannot be achieved via closed formulas and deterministic optimization procedures. Multi-dimensional extensions can be found in [18] based on product quantization but this approach becomes computationally demanding when the dimension grows, an alternative being to implement a massive "embedded" Monte Carlo simulation. We propose here a third approach based on the quantization of the white noise (here a Gaussian one).…”

Algorithmic trading in a microstructural limit order book model

“…Inspired by [FPS18], we use product-quantization method and randomization techniques to build the training set Γ n on which we project (T n , Z n ) that lies on [0, T ] × E, where T n and Z n stands for the n th jump of Z and the state of Z at time t n , i.e. Z n = Z Tn , for n ≥ 0.…”

A class of finite-dimensional numerically solvable McKean-Vlasov control problems

“…Γ Y n ). This approximation belongs to the family of constant piecewise approximations, and is in the spirit of multidimensional component-wise-quantization methods already studied in the literature (see, e.g., [10]). Unfortunately, as it can be seen in Figure 1, approximation (4.6) is discontinuous w.r.t.…”