Functional quantization of rough volatility and applications to volatility derivatives
Abstract.
We develop a product functional quantization of rough volatility. Since the optimal quantizers can be computed offline, this new technique, built on the insightful works by Luschgy and Pagès [31, 32, 35], becomes a strong competitor in the new arena of numerical tools for rough volatility. We concentrate our numerical analysis on the pricing of options on the VIX and realized variance in the rough Bergomi model [4] and compare our results to other benchmarks recently suggested.
Keywords: Riemann-Liouville process, Volterra process, functional quantization, series expansion, rough volatility, VIX options.
1. Introduction
Gatheral, Jaisson and Rosenbaum [18] recently introduced a new framework for financial modelling. To be precise — according to the reference website https://sites.google.com/site/roughvol/home — almost twenty-four hundred days have passed since instantaneous volatility was shown to have a rough nature, in the sense that its sample paths are -Hölder-continuous with . Many studies, both empirical [8, 15, 16] and theoretical [14, 3], have confirmed this, showing that these so-called rough volatility models are a more accurate fit to the implied volatility surface and to estimate historical volatility time series.
On equity markets, the quality of a model is usually measured by its ability to calibrate not only to the SPX implied volatility but also VIX Futures and the VIX implied volatility. The market standard models had so far been Markovian, in particular the double mean-reverting process [19, 24], Bergomi’s model [9] and, to some extent, jump models [10, 29]. However, they each suffer from several drawbacks, which the new generation of rough volatility models seems to overcome. For VIX Futures pricing, the rough version of Bergomi’s model was thoroughly investigated in [26], showing accurate results. Nothing comes for free though and the new challenges set by rough volatility models lie on the numerical side, as new tools are needed to develop fast and accurate numerical techniques. Since classical simulation tools for fractional Brownian motions are too slow for realistic purposes, new schemes have been proposed to speed it up, among which the Monte Carlo hybrid scheme [8, 33], a tree formulation [22], quasi Monte-Carlo methods [7] and Markovian approximations [1, 11].
We suggest here a new approach, based on product functional quantization [35].
Quantization was originally conceived as a discretization technique to approximate a continuous signal by a discrete one [38],
later developed at Bell Laboratory in the 1950s for signal transmission [20].
It was however only in the 1990s that its power to compute (conditional) expectations of functionals of random variables [21]
was fully understood.
Given an -valued random vector on some probability space,
optimal vector quantization investigates how to select an -valued random vector ,
supported on at most elements, that best approximates according to a given criterion
(such as the -distance, ).
Functional quantization is the infinite-dimensional version,
approximating a stochastic process with a random vector taking a finite number of values in the space of trajectories for the original process.
It has been investigated precisely [31, 35] in the case of Brownian diffusions,
in particular for financial applications [36].
However, optimal functional quantizers are in general hard to compute numerically and instead product functional quantizers provide a rate-optimal (so, in principle, sub-optimal) alternative often admitting closed-form expressions [32, 36].
In Section 2 we briefly review important properties of Gaussian Volterra processes, displaying a series expansion representation, and paying special attention to the Riemann-Liouville case in Section 2.2. This expansion yields, in Section 3, a product functional quantization of the processes, that shows an -error of order , with the number of paths and a regularity index. We then show, in Section 3.1, that these functional quantizers, although sub-optimal, are stationary. We specialise our setup to the generalized rough Bergomi model in Section 4 and show how product functional quantization applies to the pricing of VIX Futures and VIX options, proving in particular precise rates of convergence. Finally, Section 5 provides a numerical confirmation of the quality of our approximations for VIX Futures and Call Options on the VIX in the rough Bergomi model, benchmarked against other existing schemes. In this Section, we also discuss how product functional quantization of the Riemann-Liouville process itself can be exploited to price options on realized variance.
Notations.
We set as the set of strictly positive natural numbers. We denote by the space of real-valued continuous functions over and by the Hilbert space of real-valued square integrable functions on , with inner product , inducing the norm , for each . denotes the space of square integrable (with respect to ) random variables.
2. Gaussian Volterra processes on
For clarity, we restrict ourselves to the time interval . Let be a standard Brownian motion on a filtered probability space , with its natural filtration. On this probability space we introduce the Volterra process
(1) |
and we consider the following assumptions for the kernel :
Assumption 2.1.
There exist and continuously differentiable, slowly varying at , that is, for any , , and bounded away from function with , for , for some , such that
This implies in particular that , so that the stochastic integral (1) is well defined. The Gamma kernel, with , for and , is a classical example satisfying Assumption 2.1. Straightforward computations show that the covariance function of reads
(2) |
Under Assumption 2.1, is a Gaussian process admitting a version which is -Hölder continuous for any and hence also admits a continuous version [8, Proposition 2.11].
2.1. Series expansion
We introduce a series expansion representation for the centered Gaussian process in (1), which will be key to develop its functional quantization. Inspired by [32], introduce the stochastic process
(3) |
where is a sequence of i.i.d. standard Gaussian random variables, denotes the orthonormal basis of :
(4) |
and the operator is defined for as
(5) |
Remark 2.2.
The stochastic process in (3) is defined as a weighted sum of independent centered Gaussian variables, so for every the random variable is a centered Gaussian random variable and the whole process is Gaussian with zero mean.
We set the following assumptions on the functions :
Assumption 2.3.
There exists such that
-
(A)
there is a constant for which, for any , is -Hölder continuous, with
-
(B)
there exists a constant such that
Notice that under these assumptions, the series (3) converges both almost surely and in for each by Khintchine-Kolmogorov Convergence Theorem [12, Theorem 1, Section 5.1].
It is natural to wonder whether Assumption 2.1 implies Assumption 2.3 given the basis functions (4). This is far from trivial in our general setup and we provide examples and justifications later on for models of interest. Similar considerations with slightly different conditions can be found in [32]. We now focus on the variance-covariance structure of the Gaussian process .
Lemma 2.4.
For any , the covariance function of is given by
Proof.
Remark 2.5.
Notice that the centered Gaussian stochastic process admits a continuous version, too. Indeed, we have shown that has the same mean and covariance function as and, consequently, that the increments of the two processes share the same distribution. Thus, [8, Proposition 2.11] applies to as well, yielding that the process admits a continuous version. This last key property of can be alternatively proved directly as done in Appendix A.2.
Lemma 2.4 implies that for all . Both and are continuous, centered, Gaussian with the same covariance structure, so from now on we will work with , using
(6) |
2.2. The Riemann - Liouville case
For , with , the process (1) takes the form
(7) |
where we add the superscript to emphasise its importance. It is called a Riemann-Liouville process (henceforth RL) (also known as Type II fractional Brownian motion or Lévy fractional Brownian motion), as it is obtained by applying the Riemann-Liouville fractional operator to the standard Brownian motion, and is an example of a Volterra process. This process enjoys properties similar to those of the fractional Brownian motion (fBM), in particular being -self-similar and centered Gaussian. However, contrary to the fractional Brownian motion, its increments are not stationary. For a more detailed comparison between the fBM and we refer to [37, Theorem 5.1]. In the RL case, the covariance function is available [25, Proposition 2.1] explicitly as
where denotes the Gauss hypergeometric function [34, Chapter 5, Section 9]. More generally, [34, Chapter 5, Section 11], the generalized Hypergeometric functions are defined as
(8) |
with the Pochammer’s notation and , for , where none of the are negative integers or zero. For the series (8) converges for all and when convergence holds for and the function is defined outside this disk by analytic continuation. Finally, when the series diverges for nonzero unless one of the ’s is zero or a negative integer.
Regarding the series representation (3), we have, for and ,
(9) | ||||
(10) |
Assumption 2.3 holds in the RL case here using [32, Lemma 4] (identifying to from [32, Equation (3.7)]). Assumption 2.3 (B) implies that, for all ,
and therefore the series (3) converges both almost surely and in for each by Khintchine-Kolmogorov Convergence Theorem [12, Theorem 1, Section 5.1].
Remark 2.6.
The expansion (3) is in general not a Karhunen-Loève decomposition [36, Section 4.1.1]. In the RL case, it can be numerically checked that the basis is not orthogonal in and does not correspond to eigenvectors for the covariance operator of the Riemann-Liouville process. In his PhD Thesis [13], Corlay exploited a numerical method to obtain approximations of the first terms in the K-L expansion of processes for which an explicit form is not available.
3. Functional quantization and error estimation
Optimal (quadratic) vector quantization was conceived to approximate a square integrable random vector by another one , taking at most a finite number of values, on a grid , with . The quantization of is defined as , where denotes the nearest neighbour projection. Of course the choice of the -quantizer is based on a given optimality criterion: in most cases minimizes the distance . We recall basic results for one-dimensional standard Gaussian, which shall be needed later, and refer to [21] for a comprehensive introduction to quantization.
Definition 3.1.
Let be a one-dimensional standard Gaussian on a probability space . For each , we define the optimal quadratic -quantization of as the random variable , where is the unique optimal quadratic -quantizer of , namely the unique solution to the minimization problem
and is a Voronoi partition of , that is a Borel partition of that satisfies
where the right-hand side denotes the closure of the set in .
The unique optimal quadratic -quantizer and the corresponding quadratic error are available online, at http://www.quantize.maths-fi.com/gaussian_database for .
Given a stochastic process, viewed as a random vector taking values in its trajectories space, such as , functional quantization does the analogue to vector quantization in an infinite-dimensional setting, approximating the process with a finite number of trajectories. In this section, we focus on product functional quantization of the centered Gaussian process from (1) of order (see [35, Section 7.4] for a general introduction to product functional quantization). Recall that we are working with the continuous version of in the series (6). For any , we introduce the following set, which will be of key importance all throughout the paper:
(11) |
Definition 3.2.
A product functional quantization of of order is defined as
(12) |
where , for some , and for every is the (unique) optimal quadratic quantization of the standard Gaussian random variable of order , according to Definition 3.1.
Remark 3.3.
Before proceeding, we need to make precise the explicit form for the product functional quantizer of the stochastic process :
Definition 3.4.
The product functional -quantizer of is defined as
(13) |
for and for each
Remark 3.5.
Intuitively, the quantizer is chosen as a Cartesian product of grids of the one-dimensional standard Gaussian random variables. So, we also immediately find the probability associated to every trajectory : for every ,
(14) |
where is the -th Voronoi cell relative to the -quantizer in Definition 3.1.
The following, proved in Appendix A.1, deals with the quantization error estimation and its minimization and provides hints to choose . A similar result on the error can be obtained applying [32, Theorem 2] to the first example provided in the reference. For completeness we preferred to prove the result in an autonomous way in order to further characterize the explicit expression of the rate optimal parameters. Indeed, we then compare these rate optimal parameters with the (numerically computed) optimal ones in Section 5.1. The symbol denotes the lower integer part.
Proposition 3.6.
Under Assumption 2.3, for any , there exist and such that
where and with, for each ,
(15) |
Furthermore .
Remark 3.7.
In the RL case, the trajectories of are easily computable and they are used in the numerical implementations to approximate the process . In practice, the parameters and are chosen as explained in Section 5.1.
3.1. Stationarity
We now show that the quantizers we are using are stationary. The use of stationary quantizers is motivated by the fact that their expectation provides a lower bound for the expectation of convex functionals of the process (Remark 3.9) and they yield a lower (weak) error in cubature formulae [35, page 26]. We first recall the definition of stationarity for the quadratic quantizer of a random vector [35, Definition 1].
Definition 3.8.
Let be an -valued random vector on . A quantizer for is stationary if the nearest neighbour projection satisfies
(16) |
Remark 3.9.
Taking expectation on both sides of (16) yields Furthermore, for any convex function , the identity above, the conditional Jensen’s inequality and the tower property yield
While an optimal quadratic quantizer of order of a random vector is always stationary [35, Proposition 1(c)], the converse is not true in general. We now present the corresponding definition for a stochastic process.
Definition 3.10.
Let be a stochastic process on . We say that an -quantizer , inducing the quantization , is stationary if , for all .
Remark 3.11.
To ease the notation, we omit the grid in , while the dependence on the dimension remains via the superscript (recall (12)).
As was stated in Section 2.1, we are working with the continuous version of the Gaussian Volterra process given by the series expansion (6). This will ease the proof of stationarity below (for a similar result in the case of the Brownian motion [35, Proposition 2]).
Proposition 3.12.
The product functional quantizers inducing in (12) are stationary.
Proof.
For any , by linearity, we have the following chain of equalities:
Since the -Gaussian ’s are i.i.d., by definition of optimal quadratic quantizers (hence stationary), we have , for all , and therefore
Thus, we obtain
Finally, exploiting the tower property and the fact that the -algebra generated by is included in the -algebra generated by by Definition 3.2, we obtain
which concludes the proof. ∎
4. Application to VIX derivatives in rough Bergomi
We now specialize the setup above to the case of rough volatility models. These models are extensions of classical stochastic volatility models, introduced to better reproduce the market implied volatility surface. The volatility process is stochastic and driven by a rough process, by which we mean a process whose trajectories are -Hölder continuous with . The empirical study [18] was the first to suggest such a rough behaviour for the volatility, and ignited tremendous interest in the topic. The website https://sites.google.com/site/roughvol/home contains an exhaustive and up-to-date review of the literature on rough volatility. Unlike continuous Markovian stochastic volatility models, which are not able to fully describe the steep implied volatility skew of short-maturity options in equity markets, rough volatility models have shown accurate fit for this crucial feature. Within rough volatility, the rough Bergomi model [4] is one of the simplest, yet decisive frameworks to harness the power of the roughness for pricing purposes. We show how to adapt our functional quantization setup to this case.
4.1. The generalized Bergomi model
We work here with a slightly generalised version of the rough Bergomi model, defined as
(17) |
where is the log-stock price, the instantaneous variance process driven by the Gaussian Volterra process in (1), and is a Brownian motion defined as for some correlation and orthogonal Brownian motions. The filtered probability space is therefore taken as , . This is a non-Markovian generalization of Bergomi’s second generation stochastic volatility model [9], letting the variance be driven by a Gaussian Volterra process instead of a standard Brownian motion. Here, denotes the forward variance for a remaining maturity , observed at time . In particular, is the initial forward variance curve, assumed to be -measurable. Indeed, given market prices of variance swaps at time with remaining maturity , the forward variance curve can be recovered as , for all , and the process is a martingale for all fixed .
Remark 4.1.
With , , for , and , we recover the standard rough Bergomi model [4].
4.2. VIX Futures in the generalized Bergomi
We consider the pricing of VIX Futures (www.cboe.com/tradable_products/vix/) in the rough Bergomi model. They are highly liquid Futures on the Chicago Board Options Exchange Volatility Index, introduced on March 26, 2004, to allow for trading in the underlying VIX. Each VIX Future represents the expected implied volatility for the 30 days following the expiration date of the Futures contract itself. The continuous version of the VIX at time is determined by the continuous-time monitoring formula
(18) | ||||
(19) | ||||
(20) | ||||
(21) |
similarly to [26], where is equal to days, and we write (dropping the subscript when ). Thus, the price of a VIX Future with maturity is given by
(22) |
where the process is given by
(23) |
To develop a functional quantization setup for VIX Futures, we need to quantize the process , which is close, yet slightly different, from the Gaussian Volterra process in (1).
4.3. Properties of
To retrieve the same setting as above, we normalize the time interval to , that is . Then, for fixed, we define the process as
(24) |
which is well defined by the square integrability of . By definition, the process is centered Gaussian and Itô isometry gives its covariance function as
Proceeding as previously, we introduce a Gaussian process with same mean and covariance as those of , represented as a series expansion involving standard Gaussian random variables; from which product functional quantization follows. It is easy to see that the process has continuous trajectories. Indeed, , by conditional Jensen’s inequality since . Then, applying tower property, for any ,
and therefore the H-Hölder regularity of (Section 2) implies that of .
4.3.1. Series expansion
Let be an i.i.d. sequence of standard Gaussian and the orthonormal basis of from (4). Denote by the operator from to that associates to each ,
(25) |
We define the process as (recall the analogous (3)):
(26) |
Lemma 4.2.
The process is centered, Gaussian and with covariance function
To complete the analysis of , we require an analogue version of Assumption 2.3.
Assumption 4.3.
Assumption 2.3 holds for the sequence on with the constants and depending on .
4.4. The truncated RL case
We again pay special attention to the RL case, for which the operator (25) reads, for each ,
and satisfies the following, proved in Appendix A.4:
Lemma 4.4.
The functions satisfy Assumption 4.3.
A key role in this proof is played by an intermediate lemma, proved in Appendix A.3, which provides a convenient representation for the integral , , in terms of the generalised Hypergeometric function .
Lemma 4.5.
For any , the representation
holds, where and , and
(27) |
4.5. VIX Derivatives Pricing
We can now introduce the quantization for the process , similarly to Definition 3.2, recalling the definition of the set in (11):
Definition 4.7.
A product functional quantization for of order is defined as
(28) |
where , for some , and for every is the (unique) optimal quadratic quantization of the Gaussian variable of order .
The sequence denotes the orthonormal basis of given by
(29) |
and the operator is defined for as
Adapting the proof of Proposition 3.12 it is possible to prove that these quantizers are stationary, too.
Remark 4.8.
The dependence on is due to the fact that the coefficients in the series expansion depend on the time interval .
In the RL case for each , we can write, using Remark 4.6, for any :
We thus exploit to obtain an estimation of and of VIX Futures through the following
(30) | ||||
(31) |
Remark 4.9.
The expectation above reduces to the following deterministic summation, making its computation immediate:
where is the (unique) optimal quadratic quantization of of order , is the -th Voronoi cell relative to the -quantizer (Definition 3.1), with and . In the numerical illustrations displayed in Section 5, we exploited Simpson rule to evaluate these integrals. In particular, we used simps function from scipy.integrate with points.
4.6. Quantization error of VIX Derivatives
The following -error estimate is a consequence of Assumption 4.3 (B) and its proof is omitted since it is analogous to that of Proposition 3.6:
Proposition 4.10.
As a consequence, we have the following error quantification for European options on the VIX:
Theorem 4.11.
Let be a globally Lipschitz-continuous function and for some . There exists such that
(32) |
Furthermore, for any , there exist and such that, with ,
(33) |
The upper bound in (33) is an immediate consequence of (32) and Proposition 4.10. The proof of (32) is much more involved and is postponed to Appendix A.5.
Remark 4.12.
-
•
When , we obtain the price of VIX Futures and the quantization error
and, for any , Theorem 4.11 yields the existence of , such that
-
•
Since the functions and are globally Lipschitz continuous, the same bounds apply for European Call and Put options on the VIX.
5. Numerical results for the RL case
We now test the quality of the quantization on the pricing of VIX Futures in the standard rough Bergomi model, considering the RL kernel in Remark 4.1.
5.1. Practical considerations for and
Proposition 3.6 provides, for any fixed some indications on and (see (11)), for which the rate of convergence of the quantization error is . We present now a numerical algorithm to compute the optimal parameters. For a given number of trajectories , the problem is equivalent to finding and such that is minimal. Starting from (A.1) and adding and subtracting the quantity , we obtain
(34) |
where denotes the optimal quadratic quantization error for the quadratic quantizer of order of the standard Gaussian random variable (see Appendix A.1 for more details). Notice that the last term on the right-hand side of (5.1) does not depend on , nor on . We therefore simply look for and that minimize
This can be easily implemented: the functions can be obtained numerically from the Hypergeometric function and the quadratic errors are available at www.quantize.maths-fi.com/gaussian_database, for . The algorithm therefore reads as follows
-
(i)
fix ;
-
(ii)
minimize over and call it ;
-
(iii)
minimize over .
The results of the algorithm for some reference values of are available in Table 1, where represents the number of trajectories actually computed in the optimal case. In Table 2, we compute the rate optimal parameters derived in Proposition 3.6: the column ‘Relative error’ contains the normalized difference between the -quantization error made with the optimal choice of and in Table 1 and the -quantization error made with and of the corresponding line of the table, namely . In the column we display the number of trajectories actually computed in the rate-optimal case. The optimal quadratic vector quantization of a standard Gaussian of order is the random variable identically equal to zero and so when the corresponding term is uninfluential in the representation.
- | |||
- - - | |||
- - - - - | |||
- - - - - - - | |||
- - - - - - - - - | |||
- - - - - - - - - - - |
Relative error | ||||
---|---|---|---|---|
- | ||||
- - - | ||||
- - - - - | ||||
- - - - - - - - | ||||
- - - - - - - - - - | ||||
- - - - - - - - - - - - |
- 1 | Relative error | |||
---|---|---|---|---|
- - | ||||
- - - - | ||||
- - - - - - - | ||||
- - - - - - - - - | ||||
- - - - - - - - - - - |
- 2 | Relative error | |||
---|---|---|---|---|
- | ||||
- - - | ||||
- - - - - - | ||||
- - - - - - - - | ||||
- - - - - - - - - - |
5.2. The functional quantizers
The computations in Section 2 and 3 for the RL process, respectively the ones in Section 4.3 and 4.4 for , provide a way to obtain the functional quantizers of the processes.
5.2.1. Quantizers of the RL process
For the RL process, Definition 3.4 shows that its quantizer is a weighted Cartesian product of grids of the one-dimensional standard Gaussian random variables. The time-dependent weights are computed using (9), and for a fixed number of trajectories , suitable and are chosen according to the algorithm in Section 5.1. Not surprisingly, Figures 1 show that as the paths of the process get smoother ( increases) the trajectories become less fluctuating and shrink around zero. For , where the RL process reduces to the standard Brownian motion, we recover the well-known quantizer from [35, Figures 7-8]. This is consistent as in that case , and so is the Karhuenen-Loève expansion for the Brownian motion [35, Section 7.1].






5.2.2. Quantizers of
A quantizer for is defined analogously to that of using Definition 3.4. The weights in the summation are available in closed form, as shown in Remark 4.6. It is therefore possible to compute the -product functional quantizer, for any , as Figure 2 displays.


5.3. Pricing and comparison with Monte Carlo
In this section we show and comment some plots related to the estimation of prices of derivatives on the VIX and realized variance. We set the values and for the parameters and investigate three different initial forward variance curves , as in [26]:
-
Scenario 1. ;
-
Scenario 2. ;
-
Scenario 3. .
The choice of such is a consequence of the choice , consistently with [8], and of the relationship . In all these cases, is an increasing function of time, whose value at zero is close to the square of the reference value of .
5.3.1. VIX Futures Pricing
One of the most recent and effective way to compute the price of VIX Futures is a Monte-Carlo-simulation method based on Cholesky decomposition, for which we refer to [26, Section 3.3.2]. It can be considered as a good approximation of the true price when the number of computed paths is large. In fact, in [26] the authors tested three simulation-based methods (Hybrid scheme + forward Euler, Truncated Cholesky, SVD decomposition) and ‘all three methods seem to approximate the prices similarly well’. We thus consider the truncated Cholesky approach as a benchmark and take trajectories and equidistant point for the time grid.






In Figure 3,
we plot the VIX Futures prices as a function of the maturity , where ranges in months
(consistently with actual quotations) on the left, and the corresponding relative error w.r.t. the Monte Carlo benchmark on the right.
It is clear that the quantization approximates the benchmark from below and that the accuracy increases with the number of trajectories.
We highlight that the quantization scheme for VIX Futures can be sped up considerably by storing ahead the quantized trajectories for , so that we only need to compute the integrations and summations in Remark 4.9, which are extremely fast.
Grid organisation time | |||||
---|---|---|---|---|---|
1 | 0.474 | 0.491 | 0.99 | 4.113 | 37.183 |
2 | 0.476 | 0.487 | 0.752 | 4.294 | 39.134 |
3 | 0.617 | 0.536 | 0.826 | 4.197 | 37.744 |
6 | 0.474 | 0.475 | 0.787 | 4.432 | 37.847 |
9 | 0.459 | 0.6 | 0.858 | 3.73 | 41.988 |
12 | 0.498 | 0.647 | 1.016 | 3.995 | 38.045 |
Furthermore, the grid organization time itself is not that significant. In Table 3 we display the grid organization times (in seconds) as a function of the maturity (rows) expressed in months and of the number of trajectories (columns). From this table one might deduce that the time needed for the organization of the grids is suitable to be performed once per day (say every morning) as it should be for actual pricing purposes. It is interesting to note that the estimations obtained with quantization (which is an exact method) are consistent in that they mimick the trend of benchmark prices over time even for very small values of . However, as a consequence of the variance in the estimations, the Monte Carlo prices are almost useless for small values of . Moreover, improving the estimations with Monte Carlo requires to increase the number of points in the time grid with clear impact on computational time, while this is not the case with quantization since the trajectories in the quantizers are smooth. Indeed, the trajectories in the quantizers are not only smooth but also almost constant over time, hence reducing the number of time steps to get the desired level of accuracy. Notice that here we may refer also to the issue of complexity related to discretization: a quadrature formula over points has a cost , while the simulation with a Cholesky method over the same grid has cost . Finally, our quantization method does not require much RAM. Indeed, all the simulations performed with quantization can be easily run on a personal laptop111The personal computer used to run the quantization codes has the following technical specifications: RAM: 8.00 GB, SSD memory: 512 GB, Processor: AMD Ryzen 7 4700U with Radeon Graphics 2.00 GHz., while this is not the case for the Monte Carlo scheme proposed here222The computer used to run the Monte Carlo codes is a virtual machine (OpenStack/Nova/KVM/Qemu, www.openstack.org) with the following technical specifications: RAM: 32.00 GB, CPU: 8 virtual cores, Hypervisor CPU: Intel(R) Xeon(R) CPU E5-2650 v3 @ 2.30GHz, RAM 128GB, Storage: CEPH cluster (www.ceph.com).. For the sake of completeness, we also recall that combining Monte Carlo pricing of VIX futures/options with an efficient control variate speeds up the computations significantly [23].


In Figure 4, we show some plots comparing the behaviour of the empirical error with the theoretically predicted one. We have decided to display only a couple of maturities for the first scenario since the other plots are very similar. The figures display in a clear way that the order of convergence of the empirical error should be bigger than the theoretically predicted one: in particular, we expect it to be .
5.3.2. VIX Options Pricing
To complete the discussion on VIX Options pricing, we present in Figure 5 the approximation of the prices of ATM Call Options on the VIX obtained via quantization as a function of the maturity and for different numbers of trajectories against the same price computed via Monte Carlo simulations with trajectories and equidistant point for the time grid, as a benchmarch. Each plot represents a different scenario for the initial forward variance curve. For all scenarios, as the number of trajectories goes to infinity, the prices in Figure 5 are clearly converging, and the limiting curve is increasing in the maturity, as it should be.
all


5.3.3. Pricing of Continuously Monitored Options on Realized Variance
Product functional quantization of the process can be exploited for (meaningful) pricing purposes, too. We first price variance swaps, whose price is given by the following expression
Let us recall that, in the rough Bergomi model,
where , is an endogenous constant and being the initial forward variance curve. Thus, exploiting the fact that, for any fixed , is distributed according to a centred Gaussian random variable with variance , the quantity can be explicitly computed:
This is particularly handy and provides us a simple benchmark. The price is, then, approximated via quantization through
(35) |
Numerical results are presented in Figure 6. On the left-hand side we display a table with the approximations (depending on , the number of trajectories) of the price of a swap on the realized variance in Scenario 1, for , and the true value . On the right-hand side a log-log (natural logarithm) plot of the error against the function , with being a suitable positive constant. For variance swaps the error is not performing very well. It is indeed very close to the upper bound that we have computed theoretically. One possible theoretical motivation for this behaviour lies in the difference between strong and weak error rates. Weak error and strong error do not necessarily share the same order of convergence, being the weak error faster in general. See [5, 6, 17] for recent developments on the topic in the rough volatility framework. For pricing purposes, we are interested in weak error rates. Indeed, the pricing error should in principle have the following form , where is the process that we are using to approximate the original and is a functional that comes from the payoff function and that we can interpret as a test function. Thus, the functional has a smoothing effect. On the other hand, the upper bound for the quantization error we have computed is a strong error rate. This theoretical discrepancy motivates the findings in Figure 4 when pricing VIX Futures and other options on the VIX: the empirical error seems to converge with order , while the predicted order is . The different empirical rates that are seen in Figure 4 for VIX futures (roughly )) and in Figure 6 for variance swaps (much closer to ) could be also related to the different degree of pathwise regularity of the processes and . While is a.s. -Hölder, for fixed , the trajectories of are much smoother when and is bounded away from . When pricing VIX derivatives, we are quantizing almost everywhere a smooth Gaussian process (hence error rate of order , while when pricing derivatives on realized variance, we are applying quantization to a rough Gaussian process (hence error rate of order ), resulting in a deteriorated accuracy for the prices of realized volatility derivatives such as the variance swaps in Figure 6.
Furthermore, it can be easily shown that, for any and for any , with , always provides a lower bound for the true price . Indeed, since the quantizers of the process are stationary (cfr. Proposition 3.12), an application of Remark 3.9 to the convex function together with the positivity of , for any , yields
True price | |
---|---|
Quantization, | |
Quantization, | |
Quantization, | |
Quantization, | |
Quantization, |

To complete this section, we plot in Figure 7 approximated prices of European Call Options on the realized variance via quantization with trajectories and via Monte Carlo with trajectories, as a benchmark. In order to take advantage of the trajectories obtained, we compute the price of a realized variance Call option with strike and maturity as
and we approximate it via quantization through
The three plots in Figure 7 display the behaviour of the price of a European Call on the realized variance as a function of the strike price (close to the ATM value) for the three scenarios considered before.



5.3.4. Quantization and MC comparison
In order to make a fair comparison between quantization and Monte Carlo simulations, we present a figure to display, for each methodology, the computational work needed for a given error tolerance for the pricing of VIX Futures. The plots in Figure 8 should be read as follows. First, for any , we have computed the corresponding pricing errors: and where is the Monte Carlo price obtained via truncated Cholesky with trajectories, is the price computed via quantization with trajectories and RefPrice comes from the lowerbound in Equation in [26] and the associated computational time in seconds and , respectively for Monte Carlo simulation and quantization. Then, each point in the plot is associated either to a value of in case of Monte Carlo (the circles in Figure 8), or in case of quantization (the triangles in Figure 8), and its -coordinate provides the absolute value of the associated pricing error, while its -coordinate represents the associated computational cost in seconds.
These plots lead to the following observations:
-
•
For quantization, which is an exact method, the error is strictly monotone in the number of trajectories.
-
•
When a small number of trajectories is considered, quantization provides a lower error with respect to Monte Carlo, at a comparable cost.
-
•
For large numbers of trajectories Monte Carlo overcomes quantization both in terms of accuracy and of computational time.
To conclude, quantization can always be run with an arbitrary number of trajectories and furthermore for it leads to a lower error with respect to Monte Carlo, at a comparable computational cost, as it is visible from Figure 8. This makes quantization particularly suitable to be used when dealing with standard machines, i.e., laptops with a RAM memory smaller or equal to GB.


6. Conclusion
In this paper we provide, on the theoretical side, a precise and detailed result on the convergence of product functional quantizers of Gaussian Volterra processes, showing that the -error is of order , with the number of trajectories and the regularity index.
Furthermore, we explicitly characterize the rate optimal parameters, and , and we compare them with the corresponding optimal parameters, and , computed numerically.
In the rough Bergomi model, we apply product functional quantization to the pricing of VIX options, with precise rates of convergence, and of options on realized variance, comparing those – whenever possible – to standard Monte Carlo methods.
The thorough numerical analysis carried out in the paper shows that unfortunately, despite the conceptual promise of functional quantization, while the results on the VIX are very promising, other types of path-dependent options seem to require machine resources way beyond the current requirements of standard Monte Carlo schemes, as shown precisely in the case of variance swaps. While product functional quantization is an exact method, the analysis provided here does not however promise a bright future in the context of rough volatility. It may nevertheless be of practical interest when machine resources are limited and indeed the results for VIX Futures pricing are strongly encouraging in this respect. Functional quantization for rough volatility can however be salvaged when used as a control variate tool to reduce the variance in classical Monte Carlo simulations.
Appendix A Proofs
A.1. Proof of Proposition 3.6
Consider a fixed and for . We have
(36) |
using Fubini’s Theorem and the fact that is a sequence of i.i.d. Gaussian and where . The Extended Pierce Lemma [35, Theorem 1(b)] ensures that for a suitable positive constant . Exploiting this error bound and the property (B) for in Assumption 2.3, we obtain
(37) | ||||
(38) | ||||
(39) | ||||
(40) |
with . Inspired by [31, Section 4.1], we now look for an “optimal” choice of and . This reduces the error in approximating with a product quantization of the form in (12). Define the optimal product functional quantization of order as the which realizes the minimal error:
From (37) we deduce
(41) |
For any fixed we associate to the internal minimization problem the one we get by relaxing the hypothesis that :
(42) |
For this infimum, we derive a simple solution exploiting the arithmetic-geometric inequality using Lemma B.2. Setting , with , we get
and notice that the sequence is decreasing. Since ultimately the vector consists of integers, we use , . In fact, this choice guarantees that
Furthermore, setting for each , we obtain
Ordering the terms, we have , for each . From this we deduce the following inequality (notice that the left-hand side term is defined only if ):
(43) | ||||
(44) | ||||
(45) |
Hence, we are able to make a first error estimation, placing in the internal minimization of the right-hand side of (41) the result of inequality in (43).
(46) | ||||
(47) |
where and the set
(48) |
which represents all ’s such that all are positive integers. This is to avoid the case where holds only because one of the factors is zero. In fact, for all , is a positive integer if and only if . Thanks to the monotonicity of , we only need to check that
First, let us show that , defined in (48) for each , is a non-empty finite set with maximum given by of order . We can rewrite it as , where
(49) |
We can now verify that the sequence is increasing in :
which is obviously true. Furthermore the sequence diverges to infinity since
and .
We immediately deduce that is finite and, since , it is also non-empty.
Hence .
Moreover, for all , ,
which implies that .
Now, the error estimation in (46) can be further simplified exploiting the fact that, for each ,
The last inequality is a consequence of the fact that by definition. Hence,
(50) |
for some suitable constant .
Consider now the sequence , given by . For ,
so that the sequence is decreasing and the infimum in (50) is attained at . Therefore,
A.2. Proof of Remark 2.5
This can be proved specializing the computations done in [32, page 656]. Consider an arbitrary index For all , exploiting Assumption 2.3, we have that, for any ,
where Therefore
(51) |
Notice that when so that (51) implies
(52) |
In particular,
As noticed in Remark 2.2 the process is centered Gaussian. Hence, for each so is . Proposition B.1 therefore implies that, for any ,
(53) |
where , yielding existence of a continuous version of since choosing such that , Kolmogorov continuity theorem [27, Theorem 3.23] applies directly.
A.3. Proof of Lemma 4.5
Let . Using [28, Corollary 1, Equation (12)] (with ), the identity
holds for all , where denotes the Meijer-G function, generally defined through the so-called Mellin-Barnes type integral [30, Equation (1), Section 5.2]) as
(54) |
This representation holds if , and , for integers , and , for and . The last constraint is set to prevent any pole of any from coinciding with any pole of any . With , and , since , we can therefore write
(55) |
Similarly, using integration by parts and properties of generalised Hypergeometric functions,
(56) | ||||
(57) | ||||
(58) |
where the last step follows from the definition of generalized sine function . Indeed, exploiting (8), we have
Letting , , and mapping , and , we write
(59) |
where .
We therefore write, for ,
using (55)-(56), , and identifying ,
since , and . Plugging these into (A.3), we obtain
where and and as defined in the lemma.
A.4. Proof of Lemma 4.4
We first prove (A). For each and all , recall that
with the change of variables . Assume . Two situations are possible:
-
•
If , we have
with , since is Lipschitz on any compact and is -Hölder continuous.
-
•
If ,
where the dots correspond to the same computations as in the previous case and leads to the same estimation with the same constant .
This proves (A).
To prove (B), recall that, for and , the function reads
(60) |
with the change of variable . Denote from now on . From (A.4), we deduce, for each and ,
(61) |
To end the proof of (B), it therefore suffices to show that is uniformly bounded since, in that case we have
for some , proving (B). The following guarantees the uniform boundedness of in (61).
Proposition A.1.
For any , there exists such that for all , .
Proof.
For , we write
Using the representation in Lemma 4.5, we are thus left to prove that the maps and , defined in (27), are bounded on by, say and . Indeed, in this case,
The maps and are both clearly continuous. Moreover, as tends to infinity converges to a constant , for . The identities
hold (this can be checked with Wolfram Mathematica for example) and therefore,
where, in the second line, we used the change of variables .
In particular, as tends to infinity, this converges to
.
Analogously, for ,
with the same change of variables as before. This converges to as tends to infinity. For , at zero. Since , the two functions are continuous and bounded and the proposition follows. ∎
A.5. Proof of Theorem 4.11
We only provide the proof of (32) since, as already noticed, that of (33) follows immediately. Suppose that is Lipschitz continuous with constant . By Definitions (18) and (30), we have
For clarity, let , , and , with
We can therefore write, using the Lipschitz property of (with constant ) and Lemma B.3,
Now, an application of Hölder’s inequality yields
(62) | ||||
(63) | ||||
(64) |
where . It remains to show that is a strictly positive finite constant. This follows from the fact that does not explode in finite time (and so does not its quantization either). The identity and Hölder’s inequality imply
We only need to show that and are finite. Since is a positive continuous function on the compact interval , we have
(65) | ||||
(66) |
with . The inequality (65) implies
since and have the same law. The process is a continuous centered Gaussian process defined on a compact set. Thus, by Theorem 1.5.4 in [2], it is almost surely bounded there. Furthermore, exploiting Lemma B.4 and Borel-TIS inequality [2, Theorem 2.1.1], we have
(67) |
with and . The change of variable in the last term in (A.5) yields
since , and hence is finite. Now, notice that, in analogy to the last line of the proof of Proposition 3.12, for any , we have
(68) |
since the sigma-algebra generated by is included in the sigma-algebra generated by . Now, exploiting, in sequence, (68), the conditional version of , conditional Jensen’s inequality together with the convexity of , for and the tower property, we obtain
(69) |
Thus, we have
which is finite because of the proof of the finiteness of , above.
Exploiting Fubini’s theorem we rewrite as
(70) |
Since is centered Gaussian with covariance , then , with and therefore
(71) |
is finite since both and are continuous on compact intervals. Finally, for we have
Appendix B Some useful results
We recall some important results used throughout the text. Straightforward proofs are omitted.
Proposition B.1.
For a Gaussian random variable ,
Lemma B.2.
Let and positive real numbers. Then
where the infimum is attained for , for all .
Proof.
The general arithmetic-geometric inequalities imply
since by assumption. The right-hand side does not depend on , so
Choosing , for all , we obtain
which concludes the proof. ∎
Lemma B.3.
The following hold:
-
(i)
For any , .
-
(ii)
Set . For any , .
Lemma B.4.
For a positive random variable on , .
Acknowledgements
The authors would like to thank Andrea Pallavicini and Emanuela Rosazza Gianin for fruitful discussions. The second author was supported by the Grant BIRD190200 “Term Structure Dynamics in Interest Rate and Energy Markets: Modelling and Numerics”.
References
- [1] Abi Jaber, E. and El Euch, O. (2019): Multifactor approximation of rough volatility models, SIAM Journal on Financial Mathematics, 10(2), pp. 309-349.
- [2] Adler, R.J. and Taylor, J.E. (2007): Random Fields and Geometry, Springer Monographs in Mathematics, New York, Springer-Verlag.
- [3] Alòs, E.; León, J. A. and Vives J. (2007): On the short-time behavior of the implied volatility for jump-diffusion models with stochastic volatility, Finance and Stochastics, 11(4), pp. 571-589.
- [4] Bayer, C.; Friz, P.K. and Gatheral, J. (2016): Pricing under rough volatility, Quantitative Finance, 16(6), pp. 887-904.
- [5] Bayer, C.; Fukasawa, M. and Nakahara, S. (2022): On the weak convergence rate in the discretization of rough volatility models, ArXiV preprint, https://arxiv.org/abs/2203.02943.
- [6] Bayer, C.; Hall, E.J. and Tempone, R. (2021): Weak error rates for option pricing under linear rough volatility, arXiv preprint, https://arxiv.org/abs/2009.01219.
- [7] Bayer, C.; Hammouda, C.B. and Tempone, R. (2020): Hierarchical adaptive sparse grids and quasi Monte Carlo for option pricing under the rough Bergomi model, Quantitative Finance, 20(9), pp. 1457-1473.
- [8] Bennedsen, M.; Lunde, A. and Pakkanen, M.S. (2017): Hybrid scheme for Brownian semistationary processes, Finance and Stochastics, 21, pp. 931-965.
- [9] Bergomi; L. (2005); Smile dynamics II, Risk, pp. 67-73.
- [10] Carr, P.P. and Madan, D.B. (2014): Joint modeling of VIX and SPX options at a single and common maturity with risk management applications, IIE Transactions, 46(11), pp. 1125-1131.
- [11] Chen, W.; Langrené, N.; Loeper, G. and Zhu Q. (2021): Markovian approximation of the rough Bergomi model for Monte Carlo option pricing, Mathematics, 9(5), pp. 528.
- [12] Chow, Y.S. and Teichner E. (1997): Probability Theory, Springer Texts in Statistics, New York, Springer-Verlag.
- [13] Corlay, S. (2011): Quelques aspects de la quantification optimale, et applications en finance (in English, with French summary), PhD Thesis, Université Pierre et Marie Curie.
- [14] Fukasawa, M. (2011): Asymptotic analysis for stochastic volatility: martingale expansion, Finance and Stochastics, 15(4), pp. 635-654.
- [15] Fukasawa, M.; Takabatake, T. and Westphal, R. (2021): Is volatility rough?, Mathematical Finance, to appear.
- [16] Fukasawa, M. (2021): Volatility has to be rough, Quantitative Finance, 21, pp. 1-8.
- [17] Gassiat, P. (2022): Weak error rates of numerical schemes for rough volatility, arXiv preprint, https://arxiv.org/abs/2203.09298.
- [18] Gatheral, J.; Jaisson, T. and Rosenbaum, M. (2018): Volatility is rough, Quantitative Finance, 18(6), pp. 933-949.
- [19] Gatheral, J. (2008): Consistent modelling of SPX and VIX options, Presentation, Bachelier Congress, London.
- [20] Gersho, A. and Gray, R.M. (1992): Vector Quantization and signal compression, New York, Kluwer Academic Publishers.
- [21] Graf, S. and Luschgy., H. (2007): Foundations of quantization for probability distributions, Lecture Notes in Mathematics, 1730, Berlin Heidelberg, Springer.
- [22] Horvath, B.; Jacquier, A. and Muguruza A. (2019): Functional central limit theorems for rough volatility, arxiv.org/abs/1711.03078.
- [23] Horvath, B.; Jacquier, A. and Tankov P. (2020): Volatility options in rough volatility models, SIAM Journal on Financial Mathematics, 11(2).
- [24] Huh, J.; Jeon, J. and Kim, J.H. (2018): A scaled version of the double-mean-reverting model for VIX derivatives, Mathematics and Financial Economics, 12(4), pp. 495-515.
- [25] Jacquier, A.; Pakkanen, M. S. and Stone, H. (2018): Pathwise large deviations for the rough Bergomi model, Journal of Applied Probability, 55(4), pp. 1078-1092.
- [26] Jacquier, A.; Martini, C. and Muguruza, A. (2018): On VIX Futures in the rough Bergomi model, Quantitative Finance, 18(1), pp. 45-61.
- [27] Kallenberg, O. (2002): Foundations of Modern Probability, 2nd edition, Probability and Its Applications, New York, Springer-Verlag.
- [28] Karp, D.B. (2015): Representations and inequalities for generalized Hypergeometric functions, J. Math. Sci. (N.Y.), 207, pp. 885-897.
- [29] Kokholm, T. and Stisen, M. (2015): Joint pricing of VIX and SPX options with stochastic volatility and jump models, Journal of Risk Finance, 16(1), pp. 27-48.
- [30] Luke, Y.L. (1969): The special functions and their approximations, Volume 1, Academic Press, New York and London.
- [31] Luschgy, H. and Pagès, G. (2002): Functional quantization of Gaussian processes, Journal of Functional Analysis, 196(2), pp. 486-531.
- [32] Luschgy, H. and Pagès, G. (2007): High-resolution product quantization for Gaussian processes under sup-norm distortion, Bernoulli, 13(3), pp. 653-671.
- [33] McCrickerd, R. and Pakkanen, M.S. (2018): Turbocharging Monte Carlo pricing for the rough Bergomi model, Quantitative Finance, 18(11), pp. 1877-1886.
- [34] Olver, F.W.J. (1997): Asymptotics and special functions, 2nd Edition, A.K. Peters / CRC Press.
- [35] Pagès, G. (2007): Quadratic optimal functional quantization of stochastic processes and numerical applications, Monte Carlo and Quasi-Monte Carlo Methods 2006, Springer, Berlin Heidelberg, pp. 101-142.
- [36] Pagès, G. and Printems, J. (2005): Functional quantization for numerics with an application to option pricing, Monte Carlo Methods and Applications, 11(4), pp. 407-446.
- [37] Picard, J.(2011): Representation formulae for the fractional Brownian motion, Séminaire de Probabilités XLIII. Lecture Notes in Mathematics, 2006, Springer-Verlag, Berlin Heidelberg, pp. 3-70.
- [38] Sheppard, W.F. (1897): On the calculation of the most probable values of frequency-constants, for data arranged according to equidistant division of a scale, Proc. Lond. Math. Soc. (3), 1(1), pp. 353-380.
- [39] Steele, J. M. (2004): The Cauchy-Schwarz Master-Class, Cambridge University Press.