Related papers: Exact targeting of Gibbs distributions using veloc…
We introduce a new framework for efficient sampling from complex probability distributions, using a combination of optimal transport maps and the Metropolis-Hastings rule. The core idea is to use continuous transportation to transform…
We consider the stochastic ranking process with space-time dependent jump rates for the particles. The process is a simplified model of the time evolution of the rankings such as sales ranks at online bookstores. We prove that the joint…
Stochastic gradient descent is an optimisation method that combines classical gradient descent with random subsampling within the target functional. In this work, we introduce the stochastic gradient process as a continuous-time…
Score-based generative models (SGMs) are powerful tools to sample from complex data distributions. Their underlying idea is to (i) run a forward process for time $T_1$ by adding noise to the data, (ii) estimate its score function, and (iii)…
Analogue to the well-known Langevin Monte Carlo method, in this article we provide a method to sample from a target distribution \(\pi\) by simulating a solution of a stochastic differential equation. Hereby, the stochastic differential…
We consider a broad class of continuous-time two-type population size-dependent Markov Branching Processes. The offspring distribution can depend on the current (alive) and total (dead and alive) populations. Using stochastic approximation…
Denoising diffusions are state-of-the-art generative models exhibiting remarkable empirical performance. They work by diffusing the data distribution into a Gaussian distribution and then learning to reverse this noising process to obtain…
In this paper, we focus on the statistical filtering problem in dynamical models with jumps. When a particular application relies on physical properties which are modeled by linear and Gaussian probability density functions with jumps, an…
In this paper, we consider projection estimates for L\'evy densities in high-frequency setup. We give a unified treatment for different sets of basis functions and focus on the asymptotic properties of the maximal deviation distribution for…
Monte Carlo sampling techniques have broad applications in machine learning, Bayesian posterior inference, and parameter estimation. Often the target distribution takes the form of a product distribution over a dataset with a large number…
We propose a method of approximating multivariate Gaussian probabilities using dynamic programming. We show that solving the optimization problem associated with a class of discrete-time finite horizon Markov decision processes with…
This paper develops a new technique for the path approximation of one-dimensional stochastic processes, more precisely the Brownian motion and families of stochastic differential equations sharply linked to the Brownian motion (usually…
In this paper we consider the numerical solutions for a class of jump diffusions with Markovian switching. After briefly reviewing necessary notions, a new jump-adapted efficient algorithm based on the Euler scheme is constructed for…
This paper gives sharp rates of convergence for natural versions of the Metropolis algorithm for sampling from the uniform distribution on a convex polytope. The singular proposal distribution, based on a walk moving locally in one of a…
Since diffusion processes arise in so many different fields, efficient tech-nics for the simulation of sample paths, like discretization schemes, represent crucial tools in applied probability. Such methods permit to obtain approximations…
The need for regression models to predict circular values arises in many scientific fields. In this work we explore a family of expressive and interpretable distributions over circle-valued random functions related to Gaussian processes…
Complex Langevin dynamics can solve the sign problem appearing in numerical simulations of theories with a complex action. In order to justify the procedure, it is important to understand the properties of the real and positive…
We use the Gaussian Phase-Space Representation to solve the real-time dynamic of interacting fermions in 1D, 2D, and 3D systems. The method is exact up to a spiking point, which represents a limit on the practical simulation time. The…
We consider a previously devised model describing Levy random walks (Phys. Rev E 79, 011110; 80, 031148, (2009)). It is demonstrated numerically that the given model describes Levy random walks with superdiffusive, ballistic, as well as…
We propose a method for sampling from Gibbs distributions of the form $\pi(x)\propto\exp(-U(x))$ by considering a family $(\pi^{t})_t$ of approximations of the target density which is such that $\pi^{t}$ exhibits favorable properties for…