Searcharxiv⌕ Search

arXiv subjects

Stefan Häfner

Publications and source records attributed to Stefan Häfner.

5 recordsLinked to original sources

Regression-based complexity reduction of the nested Monte Carlo methods

In this paper we propose a novel dual regression-based approach for pricing American options. This approach reduces the complexity of the nested Monte Carlo method and has especially simple form for time discretised diffusion processes. We analyse the complexity of the proposed approach both in the case of fixed and increasing number of exercise dates. The method is illustrated by several numerical examples.

q-fin.CP↗

Variance reduction for discretised diffusions via regression

In this paper we present a novel approach towards variance reduction for discretised diffusion processes. The proposed approach involves specially constructed control variates and allows for a significant reduction in the variance for the terminal functionals. In this way the complexity order of the standard Monte Carlo algorithm ($\varepsilon^{-3}$ in the case of a first order scheme and $\varepsilon^{-2.5}$ in the case of a second order scheme) can be reduced down to $\varepsilon^{-2+δ}$ for any $δ\in [0,0.25)$ with $\varepsilon$ being the precision to be achieved. These theoretical results are illustrated by several numerical examples.

math.PR↗

Truncated control variates for weak approximation schemes

In this paper we present an enhancement of the regression-based variance reduction approaches recently proposed in Belomestny et al. This enhancement is based on a truncation of the control variate and allows for a significant reduction of the computing time, while the complexity stays of the same order. The performances of the proposed truncated algorithms are illustrated by a numerical example.

math.PR↗

Regression-based variance reduction approach for strong approximation schemes

In this paper we present a novel approach towards variance reduction for discretised diffusion processes. The proposed approach involves specially constructed control variates and allows for a significant reduction in the variance for the terminal functionals. In this way the complexity order of the standard Monte Carlo algorithm ($\varepsilon^{-3}$) can be reduced down to $\varepsilon^{-2}\sqrt{\left|\log(\varepsilon)\right|}$ in case of the Euler scheme with $\varepsilon$ being the precision to be achieved. These theoretical results are illustrated by several numerical examples.

math.PR↗