Related papers: Strong Convergence Rates for Cox-Ingersoll-Ross Pr…
We study the convergence of a drift implicit scheme for one-dimensional SDEs that was considered by Alfonsi for the Cox-Ingersoll-Ross (CIR) process. Under general conditions, we obtain a strong convergence of order 1. In the CIR case,…
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…
We consider a stochastic version of the proximal point algorithm for optimization problems posed on a Hilbert space. A typical application of this is supervised learning. While the method is not new, it has not been extensively analyzed in…
Consider a diffusion process X, solution of a time-homogeneous stochastic differential equation. We assume that the diffusion process X is observed at discrete times, at high frequency, which means that the time step tends toward zero. In…
Gibbs measures, such as Coulomb gases, are popular in modelling systems of interacting particles. Recently, we proposed to use Gibbs measures as randomized numerical integration algorithms with respect to a target measure $\pi$ on $\mathbb…
We consider the fractional Cox-Ingersoll-Ross process satisfying the stochastic differential equation (SDE) $dX_t = aX_t\,dt + \sigma \sqrt{X_t}\,dB^H_t$ driven by a fractional Brownian motion (fBm) with Hurst parameter exceeding…
We first establish strong convergence rates for multiscale systems driven by $\alpha$-stable processes, with analyses constructed in two distinct scaling regimes. When addressing weak convergence rates of this system, we derive four…
This paper proposes a robust approximation method for solving chance constrained optimization (CCO) of polynomials. Assume the CCO is defined with an individual chance constraint that is affine in the decision variables. We construct a…
Stochastic approximation is a foundation for many algorithms found in machine learning and optimization. It is in general slow to converge: the mean square error vanishes as $O(n^{-1})$. A deterministic counterpart known as quasi-stochastic…
Modelling random dynamical systems in continuous time, diffusion processes are a powerful tool in many areas of science. Model parameters can be estimated from time-discretely observed processes using Markov chain Monte Carlo (MCMC) methods…
The Cox process is a stochastic process which generalises the Poisson process by letting the underlying intensity function itself be a stochastic process. In this paper we present a fast Bayesian inference scheme for the permanental…
This paper proposes a two-point inertial proximal point algorithm to find zero of maximal monotone operators in Hilbert spaces. We obtain weak convergence results and non-asymptotic $O(1/n)$ convergence rate of our proposed algorithm in…
We consider inference of the parameters of the diffusion term for Cox-Ingersoll-Ross and similar processes with a power type dependence of the diffusion coefficient from the underlying process. We suggest some original pathwise estimates…
We consider a non-stationary Cox-Ingersoll-Ross process. We establish a sharp large deviation principle for the maximum likelihood estimator of its drift parameter.
This paper proposes an adaptive time-stepping mothods for stochastic diffusion systems whose drift and diffusion coefficients are locally Lipschitz continuous and may exhibit polynomial growth. By controlling the growth of both the drift…
We consider the approximation of stochastic differential equations (SDEs) with non-Lipschitz drift or diffusion coefficients. We present a modified explicit Euler-Maruyama discretisation scheme that allows us to prove strong convergence,…
We consider a family of parallel methods for constrained optimization based on projected gradient descents along individual coordinate directions. In the case of polyhedral feasible sets, local convergence towards a regular solution occurs…
We consider a nonlocal approximation of the quadratic porous medium equation where the pressure is given by a convolution with a mollification kernel. It is known that when the kernel concentrates around the origin, the nonlocal equation…
We introduce kernel thinning, a new procedure for compressing a distribution $\mathbb{P}$ more effectively than i.i.d. sampling or standard thinning. Given a suitable reproducing kernel $\mathbf{k}_{\star}$ and $O(n^2)$ time, kernel…
We investigate the optimal rate of convergence in the multidimensional normal approximation of vector-valued Wiener-Ito integrals of which components all belong to the same fixed Wiener chaos. Combining Malliavin calculus, Stein's method…