SearcharxivSearch

arXiv subjects

Kathrin Glau

Publications and source records attributed to Kathrin Glau.

At least 19 recordsLinked to original sources

Function approximations for counterparty credit exposure calculations

The challenge to measure exposures regularly forces financial institutions into a choice between an overwhelming computational burden or oversimplification of risk. To resolve this unsettling dilemma, we systematically investigate replacing frequently called derivative pricers by function approximations covering all practically relevant exposure measures, including quantiles. We prove error bounds for exposure measures in terms of the $L^p$ norm, $1 \leq p < \infty$, and for the uniform norm. To fully exploit these results, we employ the Chebyshev interpolation and show exponential convergence of the resulting exposure calculations. As our main result we derive probabilistic and finite sample error bounds under mild conditions including the natural case of unbounded risk factors. We derive an asymptotic efficiency gain scaling with $n^{1/2-\varepsilon}$ for any $\varepsilon>0$ with $n$ the number of simulations. Our numerical experiments cover callable, barrier, stochastic volatility and jump features. Using 10\,000 simulations, we consistently observe significant run-time reductions in all cases with speed-up factors up to 230, and an average speed-up of 87. We also present an adaptive choice of the interpolation degree. Finally, numerical examples relying on the approximation of Greeks highlight the merit of the method beyond the presented theory.

q-fin.CP

Stability and convergence of Galerkin schemes for parabolic equations with application to Kolmogorov pricing equations in time-inhomogeneous Lévy models

Two essential quantities for the analysis of approximation schemes of evolution equations are stability and convergence. We derive stability and convergence of fully discrete approximation schemes of solutions to linear parabolic evolution equations governed by time dependent coercive operators. We consider abstract Galerkin approximations in space combined with theta-schemes in time. The level of generality of our analysis comprises both a large class of time-dependent operators and a large choice of approximating Galerkin spaces. In particular the results apply to partial integro differential equations for option pricing in time-inhomogeneous Lévy models and allows for a large variety of option types and models. The derivation builds on the strong foundation laid out by von Petersdorff and Schwab (2003) who provide the respective results for the time-homogeneous case. We discuss the assumptions in the context of option pricing.

math.AP

The Deep Parametric PDE Method: Application to Option Pricing

We propose the deep parametric PDE method to solve high-dimensional parametric partial differential equations. A single neural network approximates the solution of a whole family of PDEs after being trained without the need of sample solutions. As a practical application, we compute option prices in the multivariate Black-Scholes model. After a single training phase, the prices for different time, state and model parameters are available in milliseconds. We evaluate the accuracy in the price and a generalisation of the implied volatility with examples of up to 25 dimensions. A comparison with alternative machine learning approaches, confirms the effectiveness of the approach.

q-fin.CP

Speed-up credit exposure calculations for pricing and risk management

We introduce a new method to calculate the credit exposure of European and path-dependent options. The proposed method is able to calculate accurate expected exposure and potential future exposure profiles under the risk-neutral and the real-world measure. Key advantage of is that it delivers an accuracy comparable to a full re-evaluation and at the same time it is faster than a regression-based method. Core of the approach is solving a dynamic programming problem by function approximation. This yields a closed form approximation along the paths together with the option's delta and gamma. The simple structure allows for highly efficient evaluation of the exposures, even for a large number of simulated paths. The approach is flexible in the model choice, payoff profiles and asset classes. We validate the accuracy of the method numerically for three different equity products and a Bermudan interest rate swaption. Benchmarking against the popular least-squares Monte Carlo approach shows that our method is able to deliver a higher accuracy in a faster runtime.

q-fin.CP

Weighted Monte Carlo with least squares and randomized extended Kaczmarz for option pricing

We propose a methodology for computing single and multi-asset European option prices, and more generally expectations of scalar functions of (multivariate) random variables. This new approach combines the ability of Monte Carlo simulation to handle high-dimensional problems with the efficiency of function approximation. Specifically, we first generalize the recently developed method for multivariate integration in [arXiv:1806.05492] to integration with respect to probability measures. The method is based on the principle "approximate and integrate" in three steps i) sample the integrand at points in the integration domain, ii) approximate the integrand by solving a least-squares problem, iii) integrate the approximate function. In high-dimensional applications we face memory limitations due to large storage requirements in step ii). Combining weighted sampling and the randomized extended Kaczmarz algorithm we obtain a new efficient approach to solve large-scale least-squares problems. Our convergence and cost analysis along with numerical experiments show the effectiveness of the method in both low and high dimensions, and under the assumption of a limited number of available simulations.

q-fin.CP

Fast Calculation of Credit Exposures for Barrier and Bermudan options using Chebyshev interpolation

We introduce a new method to calculate the credit exposure of Bermudan, discretely monitored barrier and European options. Core of the approach is the application of the dynamic Chebyshev method of Glau et al. (2019). The dynamic Chebyshev method delivers a closed form approximation of the option prices along the paths together with the options' delta and gamma. Key advantage is the polynomial structure of the approximation, which allows us a highly efficient evaluation of the credit exposures, even for a large number of simulated paths. The approach is highly flexible in the model choice, payoff profiles and asset classes. We compute the exposure profiles for Bermudan and barrier options in three different equity models and compare them to the profiles of European options. The analysis reveals potential shortcomings of common simplifications in the exposure calculation. The proposed method is sufficiently simple and efficient to avoid such risk-bearing simplifications.

q-fin.CP

Low-rank tensor approximation for Chebyshev interpolation in parametric option pricing

Treating high dimensionality is one of the main challenges in the development of computational methods for solving problems arising in finance, where tasks such as pricing, calibration, and risk assessment need to be performed accurately and in real-time. Among the growing literature addressing this problem, Gass et al. [14] propose a complexity reduction technique for parametric option pricing based on Chebyshev interpolation. As the number of parameters increases, however, this method is affected by the curse of dimensionality. In this article, we extend this approach to treat high-dimensional problems: Additionally exploiting low-rank structures allows us to consider parameter spaces of high dimensions. The core of our method is to express the tensorized interpolation in tensor train (TT) format and to develop an efficient way, based on tensor completion, to approximate the interpolation coefficients. We apply the new method to two model problems: American option pricing in the Heston model and European basket option pricing in the multi-dimensional Black-Scholes model. In these examples we treat parameter spaces of dimensions up to 25. The numerical results confirm the low-rank structure of these problems and the effectiveness of our method compared to advanced techniques.

q-fin.CP

Absolute Continuity of Semimartingales

We derive equivalent conditions for the (local) absolute continuity of two laws of semimartingales on random sets. Our result generalizes previous results for classical semimartingales by replacing a strong uniqueness assumption by a weaker uniqueness assumption. The main tool is a generalized Girsanov's theorem, which relates laws of two possibly explosive semimartingales to a candidate density process. Its proof is based on an extension theorem for consistent families of probability measures. Moreover, we show that in a one-dimensional Itô-diffusion setting our result reproduces the known deterministic characterizations for (local) absolute continuity. Finally, we give a Khasminskii-type test for the absolute continuity of multi-dimensional Itô-diffusions and derive linear growth conditions for the martingale property of stochastic exponentials.

math.PR

A new approach for American option pricing: The Dynamic Chebyshev method

We introduce a new method to price American options based on Chebyshev interpolation. In each step of a dynamic programming time-stepping we approximate the value function with Chebyshev polynomials. The key advantage of this approach is that it allows to shift the model-dependent computations into an offline phase prior to the time-stepping. In the offline part a family of generalised (conditional) moments is computed by an appropriate numerical technique such as a Monte Carlo, PDE or Fourier transform based method. Thanks to this methodological flexibility the approach applies to a large variety of models. Online, the backward induction is solved on a discrete Chebyshev grid, and no (conditional) expectations need to be computed. For each time step the method delivers a closed form approximation of the price function along with the options' delta and gamma. Moreover, the same family of (conditional) moments yield multiple outputs including the option prices for different strikes, maturities and different payoff profiles. We provide a theoretical error analysis and find conditions that imply explicit error bounds for a variety of stock price models. Numerical experiments confirm the fast convergence of prices and sensitivities. An empirical investigation of accuracy and runtime also shows an efficiency gain compared with the least-square Monte-Carlo method introduced by Longstaff and Schwartz (2001).

q-fin.CP

The Chebyshev method for the implied volatility

The implied volatility is a crucial element of any financial toolbox, since it is used for quoting and the hedging of options as well as for model calibration. In contrast to the Black-Scholes formula its inverse, the implied volatility, is not explicitly available and numerical approximation is required. We propose a bivariate interpolation of the implied volatility surface based on Chebyshev polynomials. This yields a closed-form approximation of the implied volatility, which is easy to implement and to maintain. We prove a subexponential error decay. This allows us to obtain an accuracy close to machine precision with polynomials of a low degree. We compare the performance of the method in terms of runtime and accuracy to the most common reference methods. In contrast to existing interpolation methods, the proposed method is able to compute the implied volatility for all relevant option data. In this context, numerical experiments confirm a considerable increase in efficiency, especially for large data sets.

q-fin.CP

Improved error bound for multivariate Chebyshev polynomial interpolation

Chebyshev interpolation is a highly effective, intensively studied method and enjoys excellent numerical properties. The interpolation nodes are known beforehand, implementation is straightforward and the method is numerically stable. For efficiency, a sharp error bound is essential, in particular for high-dimensional applications. For tensorized Chebyshev interpolation, we present an error bound that improves existing results significantly.

math.NA

Model reduction for calibration of American options

American put options are among the most frequently traded single stock options, and their calibration is computationally challenging since no closed-form expression is available. Due to the higher flexibility in comparison to European options, the mathematical model involves additional constraints, and a variational inequality is obtained. We use the Heston stochastic volatility model to describe the price of a single stock option. In order to speed up the calibration process, we apply two model reduction strategies. Firstly, a reduced basis method (RBM) is used to define a suitable low-dimensional basis for the numerical approximation of the parameter-dependent partial differential equation ($μ$PDE) model. By doing so the computational complexity for solving the $μ$PDE is drastically reduced, and applications of standard minimization algorithms for the calibration are significantly faster than working with a high-dimensional finite element basis. Secondly, so-called de-Americanization strategies are applied. Here, the main idea is to reformulate the calibration problem for American options as a problem for European options and to exploit closed-form solutions. Both reduction techniques are systematically compared and tested for both synthetic and market data sets.

math.NA

Calibration to American Options: Numerical Investigation of the de-Americanization

American options are the reference instruments for the model calibration of a large and important class of single stocks. For this task, a fast and accurate pricing algorithm is indispensable. The literature mainly discusses pricing methods for American options that are based on Monte Carlo, tree and partial differential equation methods. We present an alternative approach that has become popular under the name de-Americanization in the financial industry. The method is easy to implement and enjoys fast run-times. Since it is based on ad hoc simplifications, however, theoretical results guaranteeing reliability are not available. To quantify the resulting methodological risk, we empirically test the performance of the de-Americanization method for calibration. We classify the scenarios in which de-Americanization performs very well. However, we also identify the cases where de-Americanization oversimplifies and can result in large errors.

q-fin.CP

Magic points in finance: Empirical integration for parametric option pricing

We propose an offline-online procedure for Fourier transform based option pricing. The method supports the acceleration of such essential tasks of mathematical finance as model calibration, real-time pricing, and, more generally, risk assessment and parameter risk estimation. We adapt the empirical magic point interpolation method of Barrault, Nguyen, Maday and Patera (2004) to parametric Fourier pricing. In the offline phase, a quadrature rule is tailored to the family of integrands of the parametric pricing problem. In the online phase, the quadrature rule then yields fast and accurate approximations of the option prices. Under analyticity assumptions the pricing error decays exponentially. Numerical experiments in one dimension confirm our theoretical findings and show a significant gain in efficiency, even for examples beyond the scope of the theoretical results.

q-fin.CP

Martingale property of exponential semimartingales: a note on explicit conditions and applications to financial models

We give a collection of explicit sufficient conditions for the true martingale property of a wide class of exponentials of semimartingales. We express the conditions in terms of semimartingale characteristics. This turns out to be very convenient in financial modeling in general. Especially it allows us to carefully discuss the question of well-definedness of semimartingale Libor models, whose construction crucially relies on a sequence of measure changes.

q-fin.MF

A unified view of LIBOR models

We provide a unified framework for modeling LIBOR rates using general semimartingales as driving processes and generic functional forms to describe the evolution of the dynamics. We derive sufficient conditions for the model to be arbitrage-free which are easily verifiable, and for the LIBOR rates to be true martingales under the respective forward measures. We discuss when the conditions are also necessary and comment on further desirable properties such as those leading to analytical tractability and positivity of rates. This framework allows to consider several popular models in the literature, such as LIBOR market models driven by Brownian motion or jump processes, the Lévy forward price model as well as the affine LIBOR model, under one umbrella. Moreover, we derive structural results about LIBOR models and show, in particular, that only models where the forward price is an exponentially affine function of the driving process preserve their structure under different forward measures.

q-fin.MF

Chebyshev Interpolation for Parametric Option Pricing

Recurrent tasks such as pricing, calibration and risk assessment need to be executed accurately and in real-time. Simultaneously we observe an increase in model sophistication on the one hand and growing demands on the quality of risk management on the other. To address the resulting computational challenges, it is natural to exploit the recurrent nature of these tasks. We concentrate on Parametric Option Pricing (POP) and show that polynomial interpolation in the parameter space promises to reduce run-times while maintaining accuracy. The attractive properties of Chebyshev interpolation and its tensorized extension enable us to identify criteria for (sub)exponential convergence and explicit error bounds. We show that these results apply to a variety of European (basket) options and affine asset models. Numerical experiments confirm our findings. Exploring the potential of the method further, we empirically investigate the efficiency of the Chebyshev method for multivariate and path-dependent options.

q-fin.CP

Martingale Property in Terms of Semimartingale Problems

Starting from the seventies mathematicians face the question whether a non-negative local martingale is a true or a strict local martingale. In this article we answer this question from a semimartingale perspective. We connect the martingale property to existence, uniqueness and topological properties of semimartingale problems. This not only leads to valuable characterizations of the martingale property, but also reveals new existence and uniqueness results for semimartingale problems. As a case study we derive explicit conditions for the martingale property of stochastic exponentials driven by infinite-dimensional Brownian motion.

math.PR