Related papers: The Longstaff--Schwartz algorithm for L\'{e}vy mod…
An American option grants the holder the right to select the time at which to exercise the option, so pricing an American option entails solving an optimal stopping problem. Difficulties in applying standard numerical methods to complex…
The randomized midpoint Langevin Monte Carlo (RLMC), introduced by Shen and Lee (2019), is a variant of classical Unadjusted Langevin Algorithm. It was shown in the literature that the RLMC is an efficient algorithm for approximating…
We introduce a general algorithm for the computation of the scale functions of a spectrally negative L\'evy process $X$, based on a natural weak approximation of $X$ via upwards skip-free continuous-time Markov chains with stationary…
We recall four open problems concerning constructing high-order matrix-exponential approximations for the infimum of a spectrally negative Levy process (with applications to first-passage/ruin probabilities, the waiting time distribution in…
The equation with the time fractional substantial derivative and space fractional derivative describes the distribution of the functionals of the L\'evy flights; and the equation is derived as the macroscopic limit of the continuous time…
We extend the Lindquist-Rachev (LR) option-pricing framework--which values derivatives in markets lacking a traded risk-free bond--by introducing common Levy jump dynamics across two risky assets. The resulting endogenous "shadow" short…
We propose a new approach to solve optimal stopping problems via simulation. Working within the backward dynamic programming/Snell envelope framework, we augment the methodology of Longstaff-Schwartz that focuses on approximating the…
In this article, we first review the connection between L\'evy processes and infinitely divisible random variables, and the classification of infinitely divisible distributions. Using this connection and the L\'evy-Khinchine representation…
Carr and Wu (2004), henceforth CW, developed a framework that encompasses almost all of the continuous-time models proposed in the option pricing literature. Their main result hinges on the stopping time property of the time changes, but…
The paper investigates two inertial extragradient algorithms for seeking a common solution to a variational inequality problem involving a monotone and Lipschitz continuous mapping and a fixed point problem with a demicontractive mapping in…
We provide analytical tools for pricing power options with exotic features (capped or log payoffs, gap options ...) in the framework of exponential L\'evy models driven by one-sided stable or tempered stable processes. Pricing formulas take…
Langevin algorithms are popular Markov chain Monte Carlo (MCMC) methods for large-scale sampling problems that often arise in data science. We propose Monte Carlo algorithms based on the discretizations of $P$-th order Langevin dynamics for…
This paper proposes a novel analysis for the Scaffold algorithm, a popular method for dealing with data heterogeneity in federated learning. While its convergence in deterministic settings--where local control variates mitigate client…
The Price model, the directed version of the Barab\'{a}si-Albert model, produces a growing directed acyclic graph. We look at variants of the model in which directed edges are added to the new vertex in one of two ways: using cumulative…
This paper establishes strong and weak convergence rates for slow-fast systems driven by $\alpha$-stable processes with jump coefficients. Unlike existing studies on multiscale systems driven by additive L\'{e}vy white noise, our model…
This paper studies minimax optimization problems $\min_x \max_y f(x,y)$, where $f(x,y)$ is $m_x$-strongly convex with respect to $x$, $m_y$-strongly concave with respect to $y$ and $(L_x,L_{xy},L_y)$-smooth. Zhang et al. provided the…
Option pricing models, essential in financial mathematics and risk management, have been extensively studied and recently advanced by AI methodologies. However, American option pricing remains challenging due to the complexity of…
Pricing options is an important problem in financial engineering. In many scenarios of practical interest, financial option prices associated to an underlying asset reduces to computing an expectation w.r.t.~a diffusion process. In general,…
We develop multi-step gradient methods for network-constrained optimization of strongly convex functions with Lipschitz-continuous gradients. Given the topology of the underlying network and bounds on the Hessian of the objective function,…
We demonstrate that the Levy-Ciesielski implementation of Lie-Trotter products enjoys several properties that make it extremely suitable for path-integral Monte Carlo simulations: fast computation of paths, fast Monte Carlo sampling, and…