This document presents a framework for efficiently pricing multi-asset options using Fourier methods. It discusses using the Fourier transform to map option pricing problems to frequency space, where the integrand may have better regularity. A damping parameter is introduced to ensure the transformed functions have sufficient decay at infinity. However, literature provides no guidance on choosing optimal damping parameters. The document proposes a method called Optimal Damping with Hierarchical Adaptive Quadrature to select damping parameters that improve the convergence rate of quadrature pricing methods in Fourier space. It applies this method to price options under various multi-dimensional models in numerical experiments.
Talk of Michael Samet, entitled "Optimal Damping with Hierarchical Adaptive Quadrature for Efficient Fourier Pricing of Multi-Asset Options in Lévy Models" at the International Conference on Computational Finance (ICCF)", Wuppertal June 6-10, 2022
My talk entitled "Numerical Smoothing and Hierarchical Approximations for Efficient Option Pricing and Density Estimation", that I gave at the "International Conference on Computational Finance (ICCF)", Wuppertal June 6-10, 2022. The talk is related to our recent works "Numerical Smoothing with Hierarchical Adaptive Sparse Grids and Quasi-Monte Carlo Methods for Efficient Option Pricing" (link: https://arxiv.org/abs/2111.01874) and "Multilevel Monte Carlo combined with numerical smoothing for robust and efficient option pricing and density estimation" (link: https://arxiv.org/abs/2003.05708). In these two works, we introduce the numerical smoothing technique that improves the regularity of observables when approximating expectations (or the related integration problems). We provide a smoothness analysis and we show how this technique leads to better performance for the different methods that we used (i) adaptive sparse grids, (ii) Quasi-Monte Carlo, and (iii) multilevel Monte Carlo. Our applications are option pricing and density estimation. Our approach is generic and can be applied to solve a broad class of problems, particularly for approximating distribution functions, financial Greeks computation, and risk estimation.
Workshop: Numerical Analysis of Stochastic Partial Differential Equations (NASPDE), in Network Eurandom at Eindhoven University of Technology, May 16, 2023, about my recent works (i) "Numerical Smoothing with Hierarchical Adaptive Sparse Grids and Quasi-Monte Carlo Methods for Efficient Option Pricing" (link: https://doi.org/10.1080/14697688.2022.2135455), and (ii) "Multilevel Monte Carlo with Numerical Smoothing for Robust and Efficient Computation of Probabilities and Densities" (link: https://arxiv.org/abs/2003.05708).
Typically quantifying uncertainty requires many evaluations of a computational model or simulator. If a simulator is computationally expensive and/or high-dimensional, working directly with a simulator often proves intractable. Surrogates of expensive simulators are popular and powerful tools for overcoming these challenges. I will give an overview of surrogate approaches from an applied math perspective and from a statistics perspective with the goal of setting the stage for the "other" community.
Talk of Michael Samet, entitled "Optimal Damping with Hierarchical Adaptive Quadrature for Efficient Fourier Pricing of Multi-Asset Options in Lévy Models" at the International Conference on Computational Finance (ICCF)", Wuppertal June 6-10, 2022
My talk entitled "Numerical Smoothing and Hierarchical Approximations for Efficient Option Pricing and Density Estimation", that I gave at the "International Conference on Computational Finance (ICCF)", Wuppertal June 6-10, 2022. The talk is related to our recent works "Numerical Smoothing with Hierarchical Adaptive Sparse Grids and Quasi-Monte Carlo Methods for Efficient Option Pricing" (link: https://arxiv.org/abs/2111.01874) and "Multilevel Monte Carlo combined with numerical smoothing for robust and efficient option pricing and density estimation" (link: https://arxiv.org/abs/2003.05708). In these two works, we introduce the numerical smoothing technique that improves the regularity of observables when approximating expectations (or the related integration problems). We provide a smoothness analysis and we show how this technique leads to better performance for the different methods that we used (i) adaptive sparse grids, (ii) Quasi-Monte Carlo, and (iii) multilevel Monte Carlo. Our applications are option pricing and density estimation. Our approach is generic and can be applied to solve a broad class of problems, particularly for approximating distribution functions, financial Greeks computation, and risk estimation.
Workshop: Numerical Analysis of Stochastic Partial Differential Equations (NASPDE), in Network Eurandom at Eindhoven University of Technology, May 16, 2023, about my recent works (i) "Numerical Smoothing with Hierarchical Adaptive Sparse Grids and Quasi-Monte Carlo Methods for Efficient Option Pricing" (link: https://doi.org/10.1080/14697688.2022.2135455), and (ii) "Multilevel Monte Carlo with Numerical Smoothing for Robust and Efficient Computation of Probabilities and Densities" (link: https://arxiv.org/abs/2003.05708).
Typically quantifying uncertainty requires many evaluations of a computational model or simulator. If a simulator is computationally expensive and/or high-dimensional, working directly with a simulator often proves intractable. Surrogates of expensive simulators are popular and powerful tools for overcoming these challenges. I will give an overview of surrogate approaches from an applied math perspective and from a statistics perspective with the goal of setting the stage for the "other" community.
My talk at the International Conference on Monte Carlo Methods and Applications (MCM2032) related to advances in mathematical aspects of stochastic simulation and Monte Carlo methods at Sorbonne Université June 28, 2023, about my recent works (i) "Numerical Smoothing with Hierarchical Adaptive Sparse Grids and Quasi-Monte Carlo Methods for Efficient Option Pricing" (link: https://doi.org/10.1080/14697688.2022.2135455), and (ii) "Multilevel Monte Carlo with Numerical Smoothing for Robust and Efficient Computation of Probabilities and Densities" (link: https://arxiv.org/abs/2003.05708).
Numerical Smoothing and Hierarchical Approximations for E cient Option Pricin...Chiheb Ben Hammouda
My talk at the "Stochastic Numerics and Statistical Learning: Theory and Applications" Workshop at KAUST (King Abdullah University of Science and Technology), May 23, 2022, about my recent works "Numerical Smoothing with Hierarchical Adaptive Sparse Grids and Quasi-Monte Carlo Methods for Efficient Option Pricing" and "Multilevel Monte Carlo combined with numerical smoothing for robust and efficient option pricing and density estimation".
Spillover Dynamics for Systemic Risk Measurement Using Spatial Financial Time...SYRTO Project
Spillover Dynamics for Systemic Risk Measurement Using Spatial Financial Time Series Models. Andre Lucas. Amsterdam - June, 25 2015. European Financial Management Association 2015 Annual Meetings.
Basic concepts and how to measure price volatility
Presented by Carlos Martins-Filho at the AGRODEP Workshop on Analytical Tools for Food Prices
and Price Volatility
June 6-7, 2011 • Dakar, Senegal
For more information on the workshop or to see the latest version of this presentation visit: http://www.agrodep.org/first-annual-workshop
We approach the screening problem - i.e. detecting which inputs of a computer model significantly impact the output - from a formal Bayesian model selection point of view. That is, we place a Gaussian process prior on the computer model and consider the $2^p$ models that result from assuming that each of the subsets of the $p$ inputs affect the response. The goal is to obtain the posterior probabilities of each of these models. In this talk, we focus on the specification of objective priors on the model-specific parameters and on convenient ways to compute the associated marginal likelihoods. These two problems that normally are seen as unrelated, have challenging connections since the priors proposed in the literature are specifically designed to have posterior modes in the boundary of the parameter space, hence precluding the application of approximate integration techniques based on e.g. Laplace approximations. We explore several ways of circumventing this difficulty, comparing different methodologies with synthetic examples taken from the literature.
Authors: Gonzalo Garcia-Donato (Universidad de Castilla-La Mancha) and Rui Paulo (Universidade de Lisboa)
A generalized class of normalized distance functions called Q-Metrics is described in this presentation. The Q-Metrics approach relies on a unique functional, using a single bounded parameter (Lambda), which characterizes the conventional distance functions in a normalized per-unit metric space. In addition to this coverage property, a distinguishing and extremely attractive characteristic of the Q-Metric function is its low computational complexity. Q-Metrics satisfy the standard metric axioms. Novel networks for classification and regression tasks are defined and constructed using Q-Metrics. These new networks are shown to outperform conventional feed forward back propagation networks with the same size when tested on real data sets.
A generalized class of normalized distance functions called Q-Metrics is described in this presentation. The Q-Metrics approach relies on a unique functional, using a single bounded parameter Lambda, which characterizes the conventional distance functions in a normalized per-unit metric space. In addition to this coverage property, a distinguishing and extremely attractive characteristic of the Q-Metric function is its low computational complexity. Q-Metrics satisfy the standard metric axioms. Novel networks for classification and regression tasks are defined and constructed using Q-Metrics. These new networks are shown to outperform conventional feed forward back propagation networks with the same size when tested on real data sets.
Stochastic reaction networks (SRNs) are a particular class of continuous-time Markov chains used to model a wide range of phenomena, including biological/chemical reactions, epidemics, risk theory, queuing, and supply chain/social/multi-agents networks. In this context, we explore the efficient estimation of statistical quantities, particularly rare event probabilities, and propose two alternative importance sampling (IS) approaches [1,2] to improve the Monte Carlo (MC) estimator efficiency. The key challenge in the IS framework is to choose an appropriate change of probability measure to achieve substantial variance reduction, which often requires insights into the underlying problem. Therefore, we propose an automated approach to obtain a highly efficient path-dependent measure change based on an original connection between finding optimal IS parameters and solving a variance minimization problem via a stochastic optimal control formulation. We pursue two alternative approaches to mitigate the curse of dimensionality when solving the resulting dynamic programming problem. In the first approach [1], we propose a learning-based method to approximate the value function using a neural network, where the parameters are determined via a stochastic optimization algorithm. As an alternative, we present in [2] a dimension reduction method, based on mapping the problem to a significantly lower dimensional space via the Markovian projection (MP) idea. The output of this model reduction technique is a low dimensional SRN (potentially one dimension) that preserves the marginal distribution of the original high-dimensional SRN system. The dynamics of the projected process are obtained via a discrete $L^2$ regression. By solving a resulting projected Hamilton-Jacobi-Bellman (HJB) equation for the reduced-dimensional SRN, we get projected IS parameters, which are then mapped back to the original full-dimensional SRN system, and result in an efficient IS-MC estimator of the full-dimensional SRN. Our analysis and numerical experiments verify that both proposed IS (learning based and MP-HJB-IS) approaches substantially reduce the MC estimator’s variance, resulting in a lower computational complexity in the rare event regime than standard MC estimators. [1] Ben Hammouda, C., Ben Rached, N., and Tempone, R., and Wiechert, S. Learning-based importance sampling via stochastic optimal control for stochastic reaction net-works. Statistics and Computing 33, no. 3 (2023): 58. [2] Ben Hammouda, C., Ben Rached, N., and Tempone, R., and Wiechert, S. (2023). Automated Importance Sampling via Optimal Control for Stochastic Reaction Networks: A Markovian Projection-based Approach. To appear soon.
Accelerating Pseudo-Marginal MCMC using Gaussian ProcessesMatt Moores
The grouped independence Metropolis-Hastings (GIMH) and Markov chain within Metropolis (MCWM) algorithms are pseudo-marginal methods used to perform Bayesian inference in latent variable models. These methods replace intractable likelihood calculations with unbiased estimates within Markov chain Monte Carlo algorithms. The GIMH method has the posterior of interest as its limiting distribution, but suffers from poor mixing if it is too computationally intensive to obtain high-precision likelihood estimates. The MCWM algorithm has better mixing properties, but less theoretical support. In this paper we accelerate the GIMH method by using a Gaussian process (GP) approximation to the log-likelihood and train this GP using a short pilot run of the MCWM algorithm. Our new method, GP-GIMH, is illustrated on simulated data from a stochastic volatility and a gene network model. Our approach produces reasonable estimates of the univariate and bivariate posterior distributions, and the posterior correlation matrix in these examples with at least an order of magnitude improvement in computing time.
Seminar Talk: Multilevel Hybrid Split Step Implicit Tau-Leap for Stochastic R...Chiheb Ben Hammouda
In biochemically reactive systems with small copy numbers of one or more reactant molecules, the dynamics are dominated by stochastic effects. To approximate those systems, discrete state-space and stochastic simulation approaches have been shown to be more relevant than continuous state-space and deterministic ones. These stochastic models constitute the theory of Stochastic Reaction Networks (SRNs). In systems characterized by having simultaneously fast and slow timescales, existing discrete space-state stochastic path simulation methods, such as the stochastic simulation algorithm (SSA) and the explicit tau-leap (explicit-TL) method, can be very slow. In this talk, we propose a novel implicit scheme, split-step implicit tau-leap (SSI-TL), to improve numerical stability and provide efficient simulation algorithms for those systems. Furthermore, to estimate statistical quantities related to SRNs, we propose a novel hybrid Multilevel Monte Carlo (MLMC) estimator in the spirit of the work by Anderson and Higham (SIAM Multiscal Model. Simul. 10(1), 2012). This estimator uses the SSI-TL scheme at levels where the explicit-TL method is not applicable due to numerical stability issues, and then, starting from a certain interface level, it switches to the explicit scheme. We present numerical examples that illustrate the achieved gains of our proposed approach in this context.
In this work, we study H∞ control wind turbine fuzzy model for finite frequency(FF) interval. Less conservative results are obtained by using Finsler’s lemma technique, generalized Kalman Yakubovich Popov (gKYP), linear matrix inequality (LMI) approach and added several separate parameters, these conditions are given in terms of LMI which can be efficiently solved numerically for the problem that such fuzzy systems are admissible with H∞ disturbance attenuation level. The FF H∞ performance approach allows the state feedback command in a specific interval, the simulation example is given to validate our results.
Digital Signal Processing[ECEG-3171]-Ch1_L06Rediet Moges
This Digital Signal Processing Lecture material is the property of the author (Rediet M.) . It is not for publication,nor is it to be sold or reproduced.
#Africa#Ethiopia
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
I am Bing Jr. I am a Signal Processing Assignment Expert at matlabassignmentexperts.com. I hold a Master's in Matlab Deakin University, Australia. I have been helping students with their assignments for the past 9 years. I solve assignments related to Signal Processing.
Visit matlabassignmentexperts.com or email info@matlabassignmentexperts.com. You can also call on +1 678 648 4277 for any assistance with Signal Processing Assignments.
Efficient Fourier Pricing of Multi-Asset Options: Quasi-Monte Carlo & Domain ...Chiheb Ben Hammouda
My talk at ICCF24 with abstract: Efficiently pricing multi-asset options poses a significant challenge in quantitative finance. While the Monte Carlo (MC) method remains a prevalent choice, its slow convergence rate can impede practical applications. Fourier methods, leveraging the knowledge of the characteristic function, have shown promise in valuing single-asset options but face hurdles in the high-dimensional context. This work advocates using the randomized quasi-MC (RQMC) quadrature to improve the scalability of Fourier methods with high dimensions. The RQMC technique benefits from the smoothness of the integrand and alleviates the curse of dimensionality while providing practical error estimates. Nonetheless, the applicability of RQMC on the unbounded domain, $\mathbb{R}^d$, requires a domain transformation to $[0,1]^d$, which may result in singularities of the transformed integrand at the corners of the hypercube, and deteriorate the rate of convergence of RQMC. To circumvent this difficulty, we design an efficient domain transformation procedure based on the derived boundary growth conditions of the integrand. This transformation preserves the sufficient regularity of the integrand and hence improves the rate of convergence of RQMC. To validate this analysis, we demonstrate the efficiency of employing RQMC with an appropriate transformation to evaluate options in the Fourier space for various pricing models, payoffs, and dimensions. Finally, we highlight the computational advantage of applying RQMC over quadrature methods in the Fourier domain, and over the MC method in the physical domain for options with up to 15 assets.
My talk at the International Conference on Monte Carlo Methods and Applications (MCM2032) related to advances in mathematical aspects of stochastic simulation and Monte Carlo methods at Sorbonne Université June 28, 2023, about my recent works (i) "Numerical Smoothing with Hierarchical Adaptive Sparse Grids and Quasi-Monte Carlo Methods for Efficient Option Pricing" (link: https://doi.org/10.1080/14697688.2022.2135455), and (ii) "Multilevel Monte Carlo with Numerical Smoothing for Robust and Efficient Computation of Probabilities and Densities" (link: https://arxiv.org/abs/2003.05708).
Numerical Smoothing and Hierarchical Approximations for E cient Option Pricin...Chiheb Ben Hammouda
My talk at the "Stochastic Numerics and Statistical Learning: Theory and Applications" Workshop at KAUST (King Abdullah University of Science and Technology), May 23, 2022, about my recent works "Numerical Smoothing with Hierarchical Adaptive Sparse Grids and Quasi-Monte Carlo Methods for Efficient Option Pricing" and "Multilevel Monte Carlo combined with numerical smoothing for robust and efficient option pricing and density estimation".
Spillover Dynamics for Systemic Risk Measurement Using Spatial Financial Time...SYRTO Project
Spillover Dynamics for Systemic Risk Measurement Using Spatial Financial Time Series Models. Andre Lucas. Amsterdam - June, 25 2015. European Financial Management Association 2015 Annual Meetings.
Basic concepts and how to measure price volatility
Presented by Carlos Martins-Filho at the AGRODEP Workshop on Analytical Tools for Food Prices
and Price Volatility
June 6-7, 2011 • Dakar, Senegal
For more information on the workshop or to see the latest version of this presentation visit: http://www.agrodep.org/first-annual-workshop
We approach the screening problem - i.e. detecting which inputs of a computer model significantly impact the output - from a formal Bayesian model selection point of view. That is, we place a Gaussian process prior on the computer model and consider the $2^p$ models that result from assuming that each of the subsets of the $p$ inputs affect the response. The goal is to obtain the posterior probabilities of each of these models. In this talk, we focus on the specification of objective priors on the model-specific parameters and on convenient ways to compute the associated marginal likelihoods. These two problems that normally are seen as unrelated, have challenging connections since the priors proposed in the literature are specifically designed to have posterior modes in the boundary of the parameter space, hence precluding the application of approximate integration techniques based on e.g. Laplace approximations. We explore several ways of circumventing this difficulty, comparing different methodologies with synthetic examples taken from the literature.
Authors: Gonzalo Garcia-Donato (Universidad de Castilla-La Mancha) and Rui Paulo (Universidade de Lisboa)
A generalized class of normalized distance functions called Q-Metrics is described in this presentation. The Q-Metrics approach relies on a unique functional, using a single bounded parameter (Lambda), which characterizes the conventional distance functions in a normalized per-unit metric space. In addition to this coverage property, a distinguishing and extremely attractive characteristic of the Q-Metric function is its low computational complexity. Q-Metrics satisfy the standard metric axioms. Novel networks for classification and regression tasks are defined and constructed using Q-Metrics. These new networks are shown to outperform conventional feed forward back propagation networks with the same size when tested on real data sets.
A generalized class of normalized distance functions called Q-Metrics is described in this presentation. The Q-Metrics approach relies on a unique functional, using a single bounded parameter Lambda, which characterizes the conventional distance functions in a normalized per-unit metric space. In addition to this coverage property, a distinguishing and extremely attractive characteristic of the Q-Metric function is its low computational complexity. Q-Metrics satisfy the standard metric axioms. Novel networks for classification and regression tasks are defined and constructed using Q-Metrics. These new networks are shown to outperform conventional feed forward back propagation networks with the same size when tested on real data sets.
Stochastic reaction networks (SRNs) are a particular class of continuous-time Markov chains used to model a wide range of phenomena, including biological/chemical reactions, epidemics, risk theory, queuing, and supply chain/social/multi-agents networks. In this context, we explore the efficient estimation of statistical quantities, particularly rare event probabilities, and propose two alternative importance sampling (IS) approaches [1,2] to improve the Monte Carlo (MC) estimator efficiency. The key challenge in the IS framework is to choose an appropriate change of probability measure to achieve substantial variance reduction, which often requires insights into the underlying problem. Therefore, we propose an automated approach to obtain a highly efficient path-dependent measure change based on an original connection between finding optimal IS parameters and solving a variance minimization problem via a stochastic optimal control formulation. We pursue two alternative approaches to mitigate the curse of dimensionality when solving the resulting dynamic programming problem. In the first approach [1], we propose a learning-based method to approximate the value function using a neural network, where the parameters are determined via a stochastic optimization algorithm. As an alternative, we present in [2] a dimension reduction method, based on mapping the problem to a significantly lower dimensional space via the Markovian projection (MP) idea. The output of this model reduction technique is a low dimensional SRN (potentially one dimension) that preserves the marginal distribution of the original high-dimensional SRN system. The dynamics of the projected process are obtained via a discrete $L^2$ regression. By solving a resulting projected Hamilton-Jacobi-Bellman (HJB) equation for the reduced-dimensional SRN, we get projected IS parameters, which are then mapped back to the original full-dimensional SRN system, and result in an efficient IS-MC estimator of the full-dimensional SRN. Our analysis and numerical experiments verify that both proposed IS (learning based and MP-HJB-IS) approaches substantially reduce the MC estimator’s variance, resulting in a lower computational complexity in the rare event regime than standard MC estimators. [1] Ben Hammouda, C., Ben Rached, N., and Tempone, R., and Wiechert, S. Learning-based importance sampling via stochastic optimal control for stochastic reaction net-works. Statistics and Computing 33, no. 3 (2023): 58. [2] Ben Hammouda, C., Ben Rached, N., and Tempone, R., and Wiechert, S. (2023). Automated Importance Sampling via Optimal Control for Stochastic Reaction Networks: A Markovian Projection-based Approach. To appear soon.
Accelerating Pseudo-Marginal MCMC using Gaussian ProcessesMatt Moores
The grouped independence Metropolis-Hastings (GIMH) and Markov chain within Metropolis (MCWM) algorithms are pseudo-marginal methods used to perform Bayesian inference in latent variable models. These methods replace intractable likelihood calculations with unbiased estimates within Markov chain Monte Carlo algorithms. The GIMH method has the posterior of interest as its limiting distribution, but suffers from poor mixing if it is too computationally intensive to obtain high-precision likelihood estimates. The MCWM algorithm has better mixing properties, but less theoretical support. In this paper we accelerate the GIMH method by using a Gaussian process (GP) approximation to the log-likelihood and train this GP using a short pilot run of the MCWM algorithm. Our new method, GP-GIMH, is illustrated on simulated data from a stochastic volatility and a gene network model. Our approach produces reasonable estimates of the univariate and bivariate posterior distributions, and the posterior correlation matrix in these examples with at least an order of magnitude improvement in computing time.
Seminar Talk: Multilevel Hybrid Split Step Implicit Tau-Leap for Stochastic R...Chiheb Ben Hammouda
In biochemically reactive systems with small copy numbers of one or more reactant molecules, the dynamics are dominated by stochastic effects. To approximate those systems, discrete state-space and stochastic simulation approaches have been shown to be more relevant than continuous state-space and deterministic ones. These stochastic models constitute the theory of Stochastic Reaction Networks (SRNs). In systems characterized by having simultaneously fast and slow timescales, existing discrete space-state stochastic path simulation methods, such as the stochastic simulation algorithm (SSA) and the explicit tau-leap (explicit-TL) method, can be very slow. In this talk, we propose a novel implicit scheme, split-step implicit tau-leap (SSI-TL), to improve numerical stability and provide efficient simulation algorithms for those systems. Furthermore, to estimate statistical quantities related to SRNs, we propose a novel hybrid Multilevel Monte Carlo (MLMC) estimator in the spirit of the work by Anderson and Higham (SIAM Multiscal Model. Simul. 10(1), 2012). This estimator uses the SSI-TL scheme at levels where the explicit-TL method is not applicable due to numerical stability issues, and then, starting from a certain interface level, it switches to the explicit scheme. We present numerical examples that illustrate the achieved gains of our proposed approach in this context.
In this work, we study H∞ control wind turbine fuzzy model for finite frequency(FF) interval. Less conservative results are obtained by using Finsler’s lemma technique, generalized Kalman Yakubovich Popov (gKYP), linear matrix inequality (LMI) approach and added several separate parameters, these conditions are given in terms of LMI which can be efficiently solved numerically for the problem that such fuzzy systems are admissible with H∞ disturbance attenuation level. The FF H∞ performance approach allows the state feedback command in a specific interval, the simulation example is given to validate our results.
Digital Signal Processing[ECEG-3171]-Ch1_L06Rediet Moges
This Digital Signal Processing Lecture material is the property of the author (Rediet M.) . It is not for publication,nor is it to be sold or reproduced.
#Africa#Ethiopia
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
I am Bing Jr. I am a Signal Processing Assignment Expert at matlabassignmentexperts.com. I hold a Master's in Matlab Deakin University, Australia. I have been helping students with their assignments for the past 9 years. I solve assignments related to Signal Processing.
Visit matlabassignmentexperts.com or email info@matlabassignmentexperts.com. You can also call on +1 678 648 4277 for any assistance with Signal Processing Assignments.
Efficient Fourier Pricing of Multi-Asset Options: Quasi-Monte Carlo & Domain ...Chiheb Ben Hammouda
My talk at ICCF24 with abstract: Efficiently pricing multi-asset options poses a significant challenge in quantitative finance. While the Monte Carlo (MC) method remains a prevalent choice, its slow convergence rate can impede practical applications. Fourier methods, leveraging the knowledge of the characteristic function, have shown promise in valuing single-asset options but face hurdles in the high-dimensional context. This work advocates using the randomized quasi-MC (RQMC) quadrature to improve the scalability of Fourier methods with high dimensions. The RQMC technique benefits from the smoothness of the integrand and alleviates the curse of dimensionality while providing practical error estimates. Nonetheless, the applicability of RQMC on the unbounded domain, $\mathbb{R}^d$, requires a domain transformation to $[0,1]^d$, which may result in singularities of the transformed integrand at the corners of the hypercube, and deteriorate the rate of convergence of RQMC. To circumvent this difficulty, we design an efficient domain transformation procedure based on the derived boundary growth conditions of the integrand. This transformation preserves the sufficient regularity of the integrand and hence improves the rate of convergence of RQMC. To validate this analysis, we demonstrate the efficiency of employing RQMC with an appropriate transformation to evaluate options in the Fourier space for various pricing models, payoffs, and dimensions. Finally, we highlight the computational advantage of applying RQMC over quadrature methods in the Fourier domain, and over the MC method in the physical domain for options with up to 15 assets.
My talk in the Mathematical Finance Seminar at Humboldt-Universität zu Berlin, October 27, 2022, about my recent works (i) "Numerical Smoothing with Hierarchical Adaptive Sparse Grids and Quasi-Monte Carlo Methods for Efficient Option Pricing" (link: https://arxiv.org/abs/2111.01874), (ii) "Multilevel Monte Carlo combined with numerical smoothing for robust and efficient option pricing and density estimation" (link: https://arxiv.org/abs/2003.05708) and (iii) "Optimal Damping with Hierarchical Adaptive Quadrature for Efficient Fourier Pricing of Multi-Asset Options in Lévy Models" (link: https://arxiv.org/abs/2203.08196)
My talk at the "15th International Conference on Monte Carlo and Quasi-Monte Carlo Methods in Scientific Computing " MCQMC conference at Johannes Kepler Universität Linz, July 20, 2022, about my recent works "Numerical Smoothing with Hierarchical Adaptive Sparse Grids and Quasi-Monte Carlo Methods for Efficient Option Pricing" and "Multilevel Monte Carlo combined with numerical smoothing for robust and efficient option pricing and density estimation."
Hierarchical Deterministic Quadrature Methods for Option Pricing under the Ro...Chiheb Ben Hammouda
Conference talk at the SIAM Conference on Financial Mathematics and Engineering, held in virtual format, June 1-4 2021, about our recently published work "Hierarchical adaptive sparse grids and quasi-Monte Carlo for option pricing under the rough Bergomi model".
- Link of the paper: https://www.tandfonline.com/doi/abs/10.1080/14697688.2020.1744700
Hierarchical Deterministic Quadrature Methods for Option Pricing under the Ro...Chiheb Ben Hammouda
Seminar talk at École des Ponts ParisTech about our recently published work "Hierarchical adaptive sparse grids and quasi-Monte Carlo for option pricing under the rough Bergomi model". - Link of the paper: https://www.tandfonline.com/doi/abs/10.1080/14697688.2020.1744700
My talk in the MCQMC Conference 2016, Stanford University. The talk is about Multilevel Hybrid Split Step Implicit Tau-Leap
for Stochastic Reaction Networks.
My talk in the International Conference on Computational Finance 2019 (ICCF2019). The talk is about designing new efficient methods for option pricing under the rough Bergomi model.
This presentation by Morris Kleiner (University of Minnesota), was made during the discussion “Competition and Regulation in Professions and Occupations” held at the Working Party No. 2 on Competition and Regulation on 10 June 2024. More papers and presentations on the topic can be found out at oe.cd/crps.
This presentation was uploaded with the author’s consent.
This presentation, created by Syed Faiz ul Hassan, explores the profound influence of media on public perception and behavior. It delves into the evolution of media from oral traditions to modern digital and social media platforms. Key topics include the role of media in information propagation, socialization, crisis awareness, globalization, and education. The presentation also examines media influence through agenda setting, propaganda, and manipulative techniques used by advertisers and marketers. Furthermore, it highlights the impact of surveillance enabled by media technologies on personal behavior and preferences. Through this comprehensive overview, the presentation aims to shed light on how media shapes collective consciousness and public opinion.
Sharpen existing tools or get a new toolbox? Contemporary cluster initiatives...Orkestra
UIIN Conference, Madrid, 27-29 May 2024
James Wilson, Orkestra and Deusto Business School
Emily Wise, Lund University
Madeline Smith, The Glasgow School of Art
Have you ever wondered how search works while visiting an e-commerce site, internal website, or searching through other types of online resources? Look no further than this informative session on the ways that taxonomies help end-users navigate the internet! Hear from taxonomists and other information professionals who have first-hand experience creating and working with taxonomies that aid in navigation, search, and discovery across a range of disciplines.
0x01 - Newton's Third Law: Static vs. Dynamic AbusersOWASP Beja
f you offer a service on the web, odds are that someone will abuse it. Be it an API, a SaaS, a PaaS, or even a static website, someone somewhere will try to figure out a way to use it to their own needs. In this talk we'll compare measures that are effective against static attackers and how to battle a dynamic attacker who adapts to your counter-measures.
About the Speaker
===============
Diogo Sousa, Engineering Manager @ Canonical
An opinionated individual with an interest in cryptography and its intersection with secure software development.
Acorn Recovery: Restore IT infra within minutesIP ServerOne
Introducing Acorn Recovery as a Service, a simple, fast, and secure managed disaster recovery (DRaaS) by IP ServerOne. A DR solution that helps restore your IT infra within minutes.
Announcement of 18th IEEE International Conference on Software Testing, Verif...
Presentation.pdf
1. Optimal Damping with Adaptive Quadrature
for Efficient Fourier Pricing of Multi-Asset Options
Chiheb Ben Hammouda
Christian
Bayer
Michael
Samet
Center for Uncertainty
Quantification
Quantification Logo Lock-up
Antonis
Papapantoleon
Raúl
Tempone
Center for Uncertainty
Quantification
Cen
Qu
Center for Uncertainty Quantification Logo Loc
SIAM Conference on Financial Mathematics and Engineering
(FM23), Philadelphia, U.S.
June 6, 2023
0
2. 1 Motivation and Framework
2 Optimal Damping with Hierarchichal Adaptive Quadrature
(ODHAQ)
3 Numerical Experiments and Results
4 Conclusions
0
3. Motivation
Aim: Pricing multi-asset options: compute E[P(XT)]
▸ P(⋅) is a payoff function (typically non-smooth).
▸ XT is a d-dimensional vector of asset prices at time T.
Standard Monte Carlo (MC)
▸ (-) Slow rate of convergence: O(M− 1
2 ).
▸ (+) Rate independent of the dimension and the regularity of the
integrand.
Deterministic quadrature methods:
▸ Tensor Product (TP): Rate of convergence O (M− r
d ) with r
being the order of bounded total derivatives of the integrand.
▸ Adaptive sparse grids quadrature (ASGQ): Rate of
convergence, O(M− p
2 ) (Chen 2018), where p > 1 is independent
from the problem dimension, and related to the order of bounded
weighted mixed (partial) derivatives of the integrand.
Better regularity of the integrand’s transform in the Fourier space
than the one in the physical space
⇒ Map the problem to the frequency space when applicable.
Notation: M: number of MC/quadrature points. 1
4. Motivation
Aim: Pricing multi-asset options: compute E[P(XT)]
▸ P(⋅) is a payoff function (typically non-smooth).
▸ XT is a d-dimensional vector of asset prices at time T.
Standard Monte Carlo (MC)
▸ (-) Slow rate of convergence: O(M− 1
2 ).
▸ (+) Rate independent of the dimension and the regularity of the
integrand.
Deterministic quadrature methods:
▸ Tensor Product (TP): Rate of convergence O (M− r
d ) with r
being the order of bounded total derivatives of the integrand.
▸ Adaptive sparse grids quadrature (ASGQ): Rate of
convergence, O(M− p
2 ) (Chen 2018), where p > 1 is independent
from the problem dimension, and related to the order of bounded
weighted mixed (partial) derivatives of the integrand.
Better regularity of the integrand’s transform in the Fourier space
than the one in the physical space
⇒ Map the problem to the frequency space when applicable.
Notation: M: number of MC/quadrature points. 1
5. Motivation
Aim: Pricing multi-asset options: compute E[P(XT)]
▸ P(⋅) is a payoff function (typically non-smooth).
▸ XT is a d-dimensional vector of asset prices at time T.
Standard Monte Carlo (MC)
▸ (-) Slow rate of convergence: O(M− 1
2 ).
▸ (+) Rate independent of the dimension and the regularity of the
integrand.
Deterministic quadrature methods:
▸ Tensor Product (TP): Rate of convergence O (M− r
d ) with r
being the order of bounded total derivatives of the integrand.
▸ Adaptive sparse grids quadrature (ASGQ): Rate of
convergence, O(M− p
2 ) (Chen 2018), where p > 1 is independent
from the problem dimension, and related to the order of bounded
weighted mixed (partial) derivatives of the integrand.
Better regularity of the integrand’s transform in the Fourier space
than the one in the physical space
⇒ Map the problem to the frequency space when applicable.
Notation: M: number of MC/quadrature points. 1
6. Motivation
Aim: Pricing multi-asset options: compute E[P(XT)]
▸ P(⋅) is a payoff function (typically non-smooth).
▸ XT is a d-dimensional vector of asset prices at time T.
Standard Monte Carlo (MC)
▸ (-) Slow rate of convergence: O(M− 1
2 ).
▸ (+) Rate independent of the dimension and the regularity of the
integrand.
Deterministic quadrature methods:
▸ Tensor Product (TP): Rate of convergence O (M− r
d ) with r
being the order of bounded total derivatives of the integrand.
▸ Adaptive sparse grids quadrature (ASGQ): Rate of
convergence, O(M− p
2 ) (Chen 2018), where p > 1 is independent
from the problem dimension, and related to the order of bounded
weighted mixed (partial) derivatives of the integrand.
Better regularity of the integrand’s transform in the Fourier space
than the one in the physical space
⇒ Map the problem to the frequency space when applicable.
Notation: M: number of MC/quadrature points. 1
7. Popular Fourier Pricing Methods
1 The whole option price is Fourier transformed w.r.t. the strike
variable (Carr and Madan 1999).
▸ A damping factor w.r.t. the strike is introduced to ensure integrability.
▸ Challenging to generalize to the multidimensional setting.
▸ The derivation must be performed separately for each problem.
2 Using the Plancherel-Parseval Theorem and the generalized inverse
Fourier transform w.r.t the log-asset price (Lewis 2001).
▸ Highly modular pricing method.
▸ A damping parameter w.r.t. the stock price variable is introduced to
ensure integrability.
▸ Easy to extend to the multivariate case (Eberlein, Glau, and
Papapantoleon 2010).
3 Replacing the probability density function by its Fourier cosine
series expansion (Fang and Oosterlee 2009)
▸ Truncation parameter of the integration domain is introduced.
▸ Cosine series coefficients of the payoff are known analytically for most
1D payoff functions, otherwise approximated numerically.
2
8. Popular Fourier Pricing Methods
1 The whole option price is Fourier transformed w.r.t. the strike
variable (Carr and Madan 1999).
▸ A damping factor w.r.t. the strike is introduced to ensure integrability.
▸ Challenging to generalize to the multidimensional setting.
▸ The derivation must be performed separately for each problem.
2 Using the Plancherel-Parseval Theorem and the generalized inverse
Fourier transform w.r.t the log-asset price (Lewis 2001).
▸ Highly modular pricing method.
▸ A damping parameter w.r.t. the stock price variable is introduced to
ensure integrability.
▸ Easy to extend to the multivariate case (Eberlein, Glau, and
Papapantoleon 2010).
3 Replacing the probability density function by its Fourier cosine
series expansion (Fang and Oosterlee 2009)
▸ Truncation parameter of the integration domain is introduced.
▸ Cosine series coefficients of the payoff are known analytically for most
1D payoff functions, otherwise approximated numerically.
2
9. Popular Fourier Pricing Methods
1 The whole option price is Fourier transformed w.r.t. the strike
variable (Carr and Madan 1999).
▸ A damping factor w.r.t. the strike is introduced to ensure integrability.
▸ Challenging to generalize to the multidimensional setting.
▸ The derivation must be performed separately for each problem.
2 Using the Plancherel-Parseval Theorem and the generalized inverse
Fourier transform w.r.t the log-asset price (Lewis 2001).
▸ Highly modular pricing method.
▸ A damping parameter w.r.t. the stock price variable is introduced to
ensure integrability.
▸ Easy to extend to the multivariate case (Eberlein, Glau, and
Papapantoleon 2010).
3 Replacing the probability density function by its Fourier cosine
series expansion (Fang and Oosterlee 2009)
▸ Truncation parameter of the integration domain is introduced.
▸ Cosine series coefficients of the payoff are known analytically for most
1D payoff functions, otherwise approximated numerically.
2
10. Fourier Pricing Formula in d Dimensions
Proposition
Let
Θm,Θp be respectively the model and payoff parameters;
̂
P(⋅): the conjugate of the Fourier transform of the payoff P(⋅);
XT : vector of log-asset prices at time T, with joint characteristic function ΦXT
(⋅);
R: vector of damping parameters ensuring integrability;
δP : strip of regularity of ̂
P(⋅); δX: strip of regularity of ΦXT
(⋅),
then the value of the option price on d stocks can be expressed as
V (Θm,Θp) = (2π)−d
e−rT
R(∫
Rd
ΦXT
(u + iR) ̂
P(u + iR)du), R ∈ δV ∶= δP ∩ δX (1)
∶= ∫
Rd
g (u;R,Θm,Θp)du
Proof.
Using the inverse generalized Fourier transform and Fubini theorems:
V (Θm,Θp) = e−rT
E[P(XT)]
= e−rT
E[(2π)−d
R(∫
Rd+iR
ei⟨u,XT ⟩ ̂
P(u)du)], R ∈ δP
= (2π)−d
e−rT
R(∫
Rd+iR
E[ei⟨u,XT⟩
] ̂
P(u)du), R ∈ δV ∶= δP ∩ δX
= (2π)−d
e−rT
R(∫
Rd
ΦXT
(u + iR) ̂
P(u + iR)du).
3
11. Framework: Pricing Models
Table 1: ΦXT
(⋅) for the different models. ⟨.,.⟩ is the standard dot product on Rd
.
Model ΦXT
(z)
GBM exp(i⟨z,X0⟩) × exp(i⟨z,r1Rd − 1
2
diag(Σ)⟩T − T
2
⟨z,Σz⟩),I[z] ∈ δX.
VG exp(i⟨z,X0⟩) × exp(i⟨z,r1Rd + µV G⟩T) × (1 − iν⟨θ,z⟩ + 1
2
ν⟨z,Σz⟩)
−1/ν
,
I[z] ∈ δX
NIG exp(i⟨z,X0⟩)×
exp(i⟨z,r1Rd + µV G⟩T)(1 − iν⟨θ,z⟩ + 1
2
ν⟨z,Σz⟩)
−1/ν
,I[z] ∈ δX
Table 2: Strip of regularity of ΦXT
(⋅): δX (Eberlein, Glau, and Papapantoleon 2010).
Model δX
GBM Rd
VG {R ∈ Rd
,(1 + ν⟨θ,R⟩ − 1
2
ν⟨R,ΣR⟩) > 0}
NIG {R ∈ Rd
,(α2
− ⟨(β − R),∆(β − R)⟩) > 0}
Notation:
Σ: Covariance matrix for the Geometric Brownian Motion (GBM) model.
ν,θ,σ,Σ: Variance Gamma (VG) model parameters.
α,β,δ,∆: Normal Inverse Gaussian (NIG) model parameters.
µV G,i = 1
ν log (1 − 1
2σ2
i ν − θiν), i = 1,...,d
µNIG,i = −δ (
√
α2 − β2
i −
√
α2 − (βi + 1)2
), i = 1,...,d
4
12. Strip of Regularity: 2D Illustration
Figure 1.1: Strip of regularity of characteristic functions, δX,
(left) VG: σ = (0.2,0.8), θ = (−0.3,0),ν = 0.257, Σ = I2
(right) NIG: α = 10,β = (−3,0),δ = 0.2,∆ = I2.
−8 −6 −4 −2 0 2 4 6
R1
−4
−3
−2
−1
0
1
2
3
4
R
2
−15 −10 −5 0 5 10
R1
−10.0
−7.5
−5.0
−2.5
0.0
2.5
5.0
7.5
10.0
R
2
" There is no guidance in the litterature on how to choose the
damping parameters, R, to improve error convergence of quadrature
methods in the Fourier space.
5
13. Effect of the Damping Parameters: 2D Illustration
u1
-1.0 -0.75 -0.5 -0.25 0.0 0.25 0.5 0.75 1.0
u2
-1.0
-0.75
-0.5
-0.25
0.0
0.25
0.5
0.75
1.0
g(u
1
,
u
2
)
0.0
200.0
400.0
600.0
800.0
u1
-1.0 -0.75 -0.5 -0.25 0.0 0.25 0.5 0.75 1.0
u2
-1.0
-0.75
-0.5
-0.25
0.0
0.25
0.5
0.75
1.0
g(u
1
,
u
2
)
2.0
4.0
6.0
8.0
10.0
u1
-1.0 -0.75 -0.5 -0.25 0.0 0.25 0.5 0.75 1.0
u2
-1.0
-0.75
-0.5
-0.25
0.0
0.25
0.5
0.75
1.0
g(u
1
,
u
2
)
3.0
4.0
5.0
6.0
u1
-1.0 -0.75 -0.5 -0.25 0.0 0.25 0.5 0.75 1.0
u2
-1.0
-0.75
-0.5
-0.25
0.0
0.25
0.5
0.75
1.0
g(u
1
,
u
2
)
-5000.0
0.0
5000.0
10000.0
15000.0
20000.0
Figure 1.2: Effect of the damping parameters on the shape of the integrand in case of
basket put on 2 stocks under VG: σ = (0.4,0.4), θ = (−0.3,−0.3),ν = 0.257
(top left) R = (0.1,0.1), (top right) R = (1,1), (bottom left) R = (2,2), (bottom right)
R = (3.3,3.3).
6
14. Aim
Design a computationally efficient Fourier method to solve (1).
Challenges
1 The choice of the damping parameters that ensure integrability
and control the regularity of the integrand.
" No precise analysis of the effect of the damping parameters
on the convergence speed or guidance on choosing them.
2 The effective treatment of the high dimensionality.
" Curse of dimensionality: cost of standard quadrature
methods grows exponentially with the number of assets.
Solution (Bayer, Ben Hammouda, Papapantoleon, Samet,
and Tempone 2022)
Parametric smoothing of the Fourier integrand via an optimized
choice of damping parameters.
Sparsification and dimension-adaptivity techniques to accelerate
the convergence of the quadrature in moderate/high dimensions.
15. 1 Motivation and Framework
2 Optimal Damping with Hierarchichal Adaptive Quadrature
(ODHAQ)
3 Numerical Experiments and Results
4 Conclusions
7
16. Optimal Damping Rule: 1D Motivation
Figure 2.1: (left) Shape of the integrand w.r.t the damping parameter, R.
(right) Convergence of relative quadrature error w.r.t. number of quadrature
points, using Gauss-Laguerre quadrature for the European put option under
VG: S0 = K = 100,r = 0,T = 1,σ = 0.4,θ = −0.3,ν = 0.257.
−4 −2 0 2 4
u
0
5
10
15
20
g(u)
R = 1
R = 3
R = 4
R = 2.29
101
N
10−3
10−2
10−1
ε
R
R = 1
R = 3
R = 4
R = 2.29
17. Optimal Damping Rule: Characterization
The analysis of the quadrature error can be performed through two representations:
1 Error estimates based on high-order derivatives for a smooth function g:
▸ (-) High-order derivatives are usually challenging to estimate and control.
▸ (-) Might result in an optimal but complex rule for choosing the damping parameters.
2 Error estimates valid for functions that can be extended holomorphically into the
complex plane
▸ (+) Corresponds to the case in Eq (1).
▸ (+) Will result in a simple rule for optimally choosing the damping parameters.
Theorem 2.1 (Error Estimate Based on Contour Integration)
∣EQN
[g]∣ = ∣
1
2πi
∮
C
KN (z)g(z)dz∣ ≤
1
2π
sup
z∈C
∣g(z)∣∮
C
∣KN (z)∥dz∣, (2)
with KN (z) =
HN (z)
πN (z)
, HN (z) = ∫
b
a
ρ(x)
πN (z)
z − x
dx
Extending (2) to the multiple dimensions is straightforward using tensorization.
The upper bound on sup
z∈C
∣g(z)∣ is independent of the quadrature method.
Notation:
The quadrature error: EQN
[g] ∶= ∫
b
a g(x)ρ(x)dx − ∑N
k=1 g (xk)wk; (a,b can be infinite)
C: a contour containing the interval [a,b] within which g(z) has no singularities.
πN (z): the roots of the orthogonal polynomial related to the considered quadrature.
9
18. Optimal Damping Rule
We propose an optimization rule for choosing the damping
parameters
R∗
∶= R∗
(Θm,Θp) = arg min
R∈δV
∥g(u;R,Θm,Θp)∥∞, (3)
where R∗
∶= (R∗
1,...,R∗
d) denotes the optimal damping parameters.
The integrand attains its maximum at the origin point u = 0Rd ;
thus solving (3) is reformulated to a simpler optimization problem
R∗
= arg min
R∈δV
g(0Rd ;R,Θm,Θp).
R: the numerical approximation of R∗
using interior-point
method.
19. Quadrature Methods
Naive Quadrature operator based on a Cartesian quadrature grid
∫
Rd
g(x)ρ(x)dx ≈
d
⊗
k=1
QNk
k [g] ∶=
N1
∑
i1=1
⋯
Nd
∑
id=1
wi1 ⋯wid
g (xi1 ,...,xid
)
" Caveat: Curse of dimension: i.e., total number of quadrature
points N = ∏d
k=1 Nk.
Solution:
1 Sparsification of the grid points to reduce computational work.
2 Dimension-adaptivity to detect important dimensions of the
integrand.
Notation:
{xik
,wik
}Nk
ik=1 are respectively the sets of quadrature points and
corresponding quadrature weights for the kth dimension, 1 ≤ k ≤ d.
QNk
k [.]: the univariate quadrature operator for the kth dimension.
11
20. Hierarchical Quadrature - 1D case
Let m(β) ∶ N+ → N+ a strictly increasing function with m(1) = 1;
β: level of quadrature
m(β): number of quadrature points used at level β, E.g.,
m(β) = 2β
− 1
Hierarchical construction: example for level 3 quadrature Qm(3)
[g]:
Qm(3)
[g] = Qm(1)
´¹¹¹¹¸¹¹¹¹¶
∆m(1)
[g] + (Qm(2)
− Qm(1)
´¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¸¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¶
∆m(2)
)[g] + (Qm(3)
− Qm(2)
´¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¸¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¹¶
∆m(3)
)[g]
Clearly ∫
Rd
g(x)ρ(x)dx =
∞
∑
β=1
∆m(β)
(g).
12
21. Hierarchical Sparse grids: Construction
Let β = [β1,...,βd] ∈ Nd
+, m(β) ∶ N+ → N+ an increasing function,
1 1D quadrature operators: Q
m(βk)
k on m(βk) points, 1 ≤ k ≤ d.
2 Detail operator: ∆
m(βk)
k = Q
m(βk)
k − Q
m(βk−1)
k , Q
m(0)
k = 0.
3 Hierarchical surplus: ∆m(β)
= ⊗d
k=1 ∆
m(βk)
k .
4 Hierarchical sparse grid approximation: on an index set I ⊂ Nd
QI
d [g] = ∑
β∈I
∆m(β)
[g] (4)
13
22. Grids Construction
Tensor Product (TP) approach: I ∶= I` = {∣∣ β ∣∣∞≤ `; β ∈ Nd
+}.
Regular sparse grids (SG): I ∶ I` = {∣∣ β ∣∣1≤ ` + d − 1; β ∈ Nd
+}
Adaptive sparse grids (ASG): Adaptive and a posteriori
construction of I = IASGQ
by profit rule
IASGQ
= {β ∈ Nd
+ ∶ Pβ ≥ T}, with Pβ =
∣∆Eβ∣
∆Wβ
:
▸ ∆Eβ = ∣Q
I∪{β}
d [g] − QI
d [g]∣;
▸ ∆Wβ = Work[Q
I∪{β}
d [g]] − Work[QI
d [g]].
Figure 2.2: 2-D Illustration (Chen 2018): Admissible index sets I (top) and
corresponding quadrature points (bottom). Left: TP; middle: SG; right: ASG .
14
23. 1 Motivation and Framework
2 Optimal Damping with Hierarchichal Adaptive Quadrature
(ODHAQ)
3 Numerical Experiments and Results
4 Conclusions
14
24. Effect of the Optimal Damping Rule on ASGQ
Figure 3.1: Convergence of the relative quadrature error w.r.t. number of the
ASGQ points for different damping parameter values.
(left) 4-Assets Basket put under GBM, (right) 4-Assets Call on min under VG.
100
101
102
103
104
Number of quadrature points
10-4
10-3
10-2
10-1
100
101
102
Relative
Error
100
101
102
103
Number of quadrature points
10-4
10-3
10-2
10-1
100
Relative
Error
Reference values computed by MC method using M = 109
samples.
The used parameters are based on the literature on model
calibration (Aguilar 2020; Healy 2021).
15
25. Comparison of our Approach against COS Method
Figure 3.2: Convergence of the relative error w.r.t. N, number of
characteristic function evaluations
(left) 1D put option under GBM, (right) 2D basket put option under GBM.
100
101
102
N
10-10
10-5
100
Relative
Error
ODHAQ
COS
100
101
102
103
104
105
N
10-4
10-3
10-2
10-1
100
Relative
Error
ODHAQ
COS
26. Comparison of our Approach against COS Method
Figure 3.3: Convergence of the relative error w.r.t. N, number of
characteristic function evaluations
(left) 1D put option under VG, (right) 1D put option under NIG.
100
101
102
N
10-4
10-3
10-2
10-1
100
101
Relative
Error
ODHAQ
COS
100
101
N
10-4
10-3
10-2
10-1
100
101
Relative
Error
ODHAQ
COS
27. Comparison of Fourier approach against MC
Table 3: Comparison of our ODHAQ approach against the MC method for
the European basket put and call on min under the VG model.
Example d Relative Error CPU Time Ratio
Basket put under VG 4 4 × 10−4
5.2%
Call on min under VG 4 9 × 10−4
0.56%
Basket put under VG 6 5 × 10−3
11%
Call on min under VG 6 3 × 10−3
1.3%
CPU Time Ratio ∶= CP U(ODHAQ)+CP U(Optimization)
CP U(MC)
× 100.
Reference values computed by MC method using M = 109
samples.
The used parameters are based on the literature on model
calibration (Aguilar 2020).
18
28. 1 Motivation and Framework
2 Optimal Damping with Hierarchichal Adaptive Quadrature
(ODHAQ)
3 Numerical Experiments and Results
4 Conclusions
18
29. Conclusions and Extension
1 We propose a rule for the choice of the damping parameters which
accelerates the convergence of the numerical quadrature for
Fourier-based option pricing.
2 We used adaptivity and sparsification techniques to alleviate the
curse of dimensionality.
3 Our Fourier approach combined with the optimal damping rule
and adaptive sparse grids quadrature achieves substantial
computational gains compared to the MC method for multi-asset
options under GBM and Lévy models.
4 Extension: Combine domain transformation with quasi-Monte
Carlo in the Fourier space: to scale better with high dimensions
" See Michael’s talk tomorrow
19
30. Related References
Thank you for your attention!
[1] C. Bayer, C. Ben Hammouda, A. Papapantoleon, M. Samet, and
R. Tempone. Optimal Damping with Hierarchical Adaptive
Quadrature for Efficient Fourier Pricing of Multi-Asset Options in
Lévy Models, arXiv:2203.08196 (2022).
[2] C. Bayer, C. Ben Hammouda, and R. Tempone. Hierarchical
adaptive sparse grids and quasi-Monte Carlo for option pricing
under the rough Bergomi model, Quantitative Finance, 2020.
[3] C. Bayer, C. Ben Hammouda, and R. Tempone. Numerical
Smoothing with Hierarchical Adaptive Sparse Grids and
Quasi-Monte Carlo Methods for Efficient Option Pricing,
Quantitative Finance (2022)
31. References I
[1] Jean-Philippe Aguilar. “Some pricing tools for the Variance
Gamma model”. In: International Journal of Theoretical and
Applied Finance 23.04 (2020), p. 2050025.
[2] C. Bayer et al. “Optimal Damping with Hierarchical Adaptive
Quadrature for Efficient Fourier Pricing of Multi-Asset Options
in Lévy Models”. In: arXiv preprint arXiv:2203.08196 (2022).
[3] Peter Carr and Dilip Madan. “Option valuation using the fast
Fourier transform”. In: Journal of computational finance 2.4
(1999), pp. 61–73.
[4] Peng Chen. “Sparse quadrature for high-dimensional integration
with Gaussian measure”. In: ESAIM: Mathematical Modelling
and Numerical Analysis 52.2 (2018), pp. 631–657.
[5] Rama Cont and Peter Tankov. Financial Modelling with Jump
Processes. Chapman and Hall/CRC, 2003.
21
32. References II
[6] Ernst Eberlein, Kathrin Glau, and Antonis Papapantoleon.
“Analysis of Fourier transform valuation formulas and
applications”. In: Applied Mathematical Finance 17.3 (2010),
pp. 211–240.
[7] Fang Fang and Cornelis W Oosterlee. “A novel pricing method
for European options based on Fourier-cosine series expansions”.
In: SIAM Journal on Scientific Computing 31.2 (2009),
pp. 826–848.
[8] Jherek Healy. “The Pricing of Vanilla Options with Cash
Dividends as a Classic Vanilla Basket Option Problem”. In:
arXiv preprint arXiv:2106.12971 (2021).
[9] Alan L Lewis. “A simple option formula for general
jump-diffusion and other exponential Lévy processes”. In:
Available at SSRN 282110 (2001).
22
33. References III
[10] Wim Schoutens. Lévy Processes in Finance: Pricing Financial
Derivatives. Wiley Online Library, 2003.
23
34. Framework
Basket put:
P(XT ) = max(K −
d
∑
i=1
eXi
T ,0);
̂
P(z) = K1−i ∑
d
j=1 zj
∏
d
j=1 Γ(−izj)
Γ(−i∑
d
j=1 zj + 2)
, z ∈ Cd
,I[z] ∈ δP
Call on min:
P(XT ) = max(min(eX1
T ,...,eXd
T ) − K,0);
̂
P(z) =
K1−i ∑
d
j=1 zj
(i(∑
d
j=1 zj) − 1)∏
d
j=1 (izj)
, z ∈ Cd
,I[z] ∈ δP
Table 4: Strip of regularity of ̂
P(⋅): δP (Eberlein, Glau, and Papapantoleon 2010).
Payoff δP
Basket put {R ∈ Rd
, Ri > 0 ∀i ∈ {1,...,d}}
Call on min {R ∈ Rd
, Ri < 0 ∀i ∈ {1,...,d},∑
d
i=1 Ri < −1}
Notation: Γ(⋅): complex Gamma function, I(⋅): imaginary part of the
argument. 24