Related papers: The Longstaff--Schwartz algorithm for L\'{e}vy mod…
In this paper we propose a general framework to characterize and solve the stochastic optimization problems with multiple objectives underlying many real world learning applications. We first propose a projection based algorithm which…
In this article, we employ a collection of stochastic differential equations with drift and diffusion coefficients approximated by neural networks to predict the trend of chaotic time series which has big jump properties. Our contributions…
The paper presents a globally convergent algorithm for solving coefficient inverse problems. Being rooted in the globally convergent numerical method (SIAM J. Sci. Comput., 31, No.1 (2008), pp. 478-509) for solving multidimensional…
We analyze confining mechanisms for L\'{e}vy flights. When they evolve in suitable external potentials their variance may exist and show signatures of a superdiffusive transport. Two classes of stochastic jump - type processes are…
First-order methods are often analyzed via their continuous-time models, where their worst-case convergence properties are usually approached via Lyapunov functions. In this work, we provide a systematic and principled approach to find and…
We consider the robust pricing and hedging of American options in a continuous time setting. We assume asset prices are continuous semimartingales, but we allow for general model uncertainty specification via adapted closed convex…
We describe an Euler scheme to approximate solutions of L\'evy driven Stochastic Differential Equations (SDE) where the grid points are random and given by the arrival times of a Poisson process. This result extends a previous work of the…
This paper explores the rates of convergence of solutions for multivariate stochastic differential equations (SDEs) driven by L\'evy processes within the small-time stable domain of attraction (DoA). Explicit bounds are derived for the…
In this work, we adapt a Monte Carlo algorithm introduced by Broadie and Glasserman (1997) to price a $\pi$-option. This method is based on the simulated price tree that comes from discretization and replication of possible trajectories of…
We consider the problem of pricing American Exchange options driven by a L\'evy process. We study the properties of American Exchange options, we represented it as the sum of the price of the corresponding European exchange option price and…
We study Langevin-type algorithms for sampling from Gibbs distributions such that the potentials are dissipative and their weak gradients have finite moduli of continuity not necessarily convergent to zero. Our main result is a…
For solving strongly convex optimization problems, we propose and study the global convergence of variants of the A-HPE and large-step A-HPE algorithms of Monteiro and Svaiter. We prove linear and the superlinear…
The Levenberg-Marquardt algorithm is one of the most popular algorithms for finding the solution of nonlinear least squares problems. Across different modified variations of the basic procedure, the algorithm enjoys global convergence, a…
In this paper we present two parallel Monte Carlo based algorithms for pricing multi--dimensional Bermudan/American options. First approach relies on computation of the optimal exercise boundary while the second relies on classification of…
This paper presents a detailed theoretical analysis of the Langevin Monte Carlo sampling algorithm recently introduced in Durmus et al. (Efficient Bayesian computation by proximal Markov chain Monte Carlo: when Langevin meets Moreau, 2016)…
In this paper, we derive comparison results for terminal values of $d$-dimensional special semimartingales and also for finite-dimensional distributions of multivariate L\'{e}vy processes. The comparison is with respect to nondecreasing,…
Based on the concept of self-decomposability, we extend some recent multivariate L\'evy models built using multivariate subordination with the aim of capturing situations in which a sudden event in one market is propagated onto related…
We provide a simple algorithm for construction of Brownian paths approximating those of a L\'evy process on a finite time interval. It requires knowledge of the L\'evy process trajectory on a chosen regular grid and the law of its endpoint,…
We present a highly efficient proximal Markov chain Monte Carlo methodology to perform Bayesian computation in imaging problems. Similarly to previous proximal Monte Carlo approaches, the proposed method is derived from an approximation of…
We establish $L^2$-exponential convergence rate for three popular piecewise deterministic Markov processes for sampling: the randomized Hamiltonian Monte Carlo method, the zigzag process, and the bouncy particle sampler. Our analysis is…