Subscribe to the gold package and get unlimited access to Shamra Academy
Register a new userQuantile Mechanics II: Changes of Variables in Monte Carlo methods and GPU-Optimized Normal Quantiles
166
0
0.0
(
0
)
Ask ChatGPT about the research
No Arabic abstract
This article presents differential equations and solution methods for the functions of the form $Q(x) = F^{-1}(G(x))$, where $F$ and $G$ are cumulative distribution functions. Such functions allow the direct recycling of Monte Carlo samples from one distribution into samples from another. The method may be developed analytically for certain special cases, and illuminate the idea that it is a more precise form of the traditional Cornish-Fisher expansion. In this manner the model risk of distributional risk may be assessed free of the Monte Carlo noise associated with resampling. Examples are given of equations for converting normal samples to Student t, and converting exponential to hyperbolic, variance gamma and normal. In the case of the normal distribution, the change of variables employed allows the sampling to take place to good accuracy based on a single rational approximation over a very wide range of the sample space. The avoidance of any branching statement is of use in optimal GPU computations as it avoids the effect of {it warp divergence}, and we give examples of branch-free normal quantiles that offer performance improvements in a GPU environment, while retaining the best precision characteristics of well-known methods. We also offer models based on a low-probability of warp divergence. Comparisons of new and old forms are made on the Nvidia Quadro 4000, GTX 285 and 480, and Tesla C2050 GPUs. We argue that in single-precision mode, the change-of-variables approach offers performance competitive with the fastest existing scheme while substantially improving precision, and that in double-precision mode, this approach offers the most GPU-optimal Gaussian quantile yet, and without compromise on precision for Monte Carlo applications, working twice as fast as the CUDA 4 library function with increased precision.
rate research
Read More
In mathematical finance and other applications of stochastic processes, it is frequently the case that the characteristic function may be known but explicit forms for density functions are not available. The simulation of any distribution is greatly facilitated by a knowledge of the quantile function, by which uniformly distributed samples may be converted to samples of the given distribution. This article analyzes the calculation of a quantile function direct from the characteristic function of a probability distribution, without explicit knowledge of the density. We form a non-linear integro-differential equation that despite its complexity admits an iterative solution for the power series of the quantile about the median. We give some examples including tail models and show how to generate C-code for examples.
We present new numerical schemes for pricing perpetual Bermudan and American options as well as $alpha$-quantile options. This includes a new direct calculation of the optimal exercise barrier for early-exercise options. Our approach is based on the Spitzer identities for general Levy processes and on the Wiener-Hopf method. Our direct calculation of the price of $alpha$-quantile options combines for the first time the Dassios-Port-Wendel identity and the Spitzer identities for the extrema of processes. Our results show that the new pricing methods provide excellent error convergence with respect to computational time when implemented with a range of Levy processes.
GPU computing has become popular in computational finance and many financial institutions are moving their CPU based applications to the GPU platform. Since most Monte Carlo algorithms are embarrassingly parallel, they benefit greatly from parallel implementations, and consequently Monte Carlo has become a focal point in GPU computing. GPU speed-up examples reported in the literature often involve Monte Carlo algorithms, and there are software tools commercially available that help migrate Monte Carlo financial pricing models to GPU. We present a survey of Monte Carlo and randomized quasi-Monte Carlo methods, and discuss existing (quasi) Monte Carlo sequences in GPU libraries. We discuss specific features of GPU architecture relevant for developing efficient (quasi) Monte Carlo methods. We introduce a recent randomized quasi-Monte Carlo method, and compare it with some of the existing implementations on GPU, when they are used in pricing caplets in the LIBOR market model and mortgage backed securities.
In this review we discuss, from a unified point of view, a variety of Monte Carlo methods used to solve eigenvalue problems in statistical mechanics and quantum mechanics. Although the applications of these methods differ widely, the underlying mathematics is quite similar in that they are stochastic implementations of the power method. In all cases, optimized trial states can be used to reduce the errors of Monte Carlo estimates.
We propose the Hawkes flocking model that assesses systemic risk in high-frequency processes at the two perspectives -- endogeneity and interactivity. We examine the futures markets of WTI crude oil and gasoline for the past decade, and perform a comparative analysis with conditional value-at-risk as a benchmark measure. In terms of high-frequency structure, we derive the empirical findings. The endogenous systemic risk in WTI was significantly higher than that in gasoline, and the level at which gasoline affects WTI was constantly higher than in the opposite case. Moreover, although the relative influences degree was asymmetric, its difference has gradually reduced.
Log in to be able to interact and post comments
comments
Fetching comments
Sign in to be able to follow your search criteria
