In this article, we present new ideas concerning Non-Gaussian Component Analysis (NGCA). We use the structural assumption that a high-dimensional random vector X can be represented as a sum of two components - a lowdimensional signal S and a noise component N. We show that this assumption...

Let a high-dimensional random vector X can be represented as a sum of two components - a signal S, which belongs to some low-dimensional subspace S, and a noise component N. This paper presents a new approach for estimating the subspace S based on the ideas of the Non-Gaussian Component...

In this paper we propose a jump-diffusion Libor model with jumps in a high-dimensional space (Rm) and test a stable non-parametric calibration algorithm which takes into account a given local covariance structure. The algorithm returns smooth and simply structured Lévy densities, and penalizes...

In this paper a novel modification of the multilevel Monte Carlo approach, allowing for further significant complexity reduction, is proposed. The idea of the modification is to use the method of control variates to reduce variance at level zero. We show that, under a proper choice of control...

In this work we consider optimal stopping problems with conditional convex risk measures called optimised certainty equivalents. Without assuming any kind of time-consistency for the underlying family of risk measures, we derive a novel representation for the solution of the optimal stopping...

We propose a new method to estimate the empirical pricing kernel based on option data. We estimate the pricing kernel nonparametrically by using the ratio of the risk-neutral density estimator and the subjective density estimator. The risk-neutral density is approximated by a weighted kernel...

In this article we propose a novel approach to reduce the computational complexity of various approximation methods for pricing discrete time American options. Given a sequence of continuation values estimates corresponding to different levels of spatial approximation and time discretization, we...

In this paper we discuss the possibility of using multilevel Monte Carlo (MLMC) methods for weak approximation schemes. It turns out that by means of a simple coupling between consecutive time discretisation levels, one can achieve the same complexity gain as under the presence of a strong...

In this article we propose a novel approach to reduce the computational complexity of the dual method for pricing American options. We consider a sequence of martingales that converges to a given target martingale and decompose the original dual representation into a sum of representations that...

Numerical algorithms for the efficient pricing of multidimensional discrete-time American and Bermudan options are constructed using regression methods and a new approach for computing upper bounds of the options' price. Using the sample space with payoffs at optimal stopping times, we propose...