Related papers: Almost Sure Diffusion Approximation in Averaging: …

We study a class of stochastic processes of the type $\frac{d^n x}{dt^n}= v_0\, \sigma(t)$ where $n>0$ is a positive integer and $\sigma(t)=\pm 1$ represents an `active' telegraphic noise that flips from one state to the other with a…

We study the Stochastic Gradient Descent (SGD) method in nonconvex optimization problems from the point of view of approximating diffusion processes. We prove rigorously that the diffusion process can approximate the SGD algorithm weakly…

In this paper we discuss a closed-form approximation of the likelihood functions of an arbitrary diffusion process. The approximation is based on an exponential ansatz of the transition probability for a finite time step $\Delta t$, and a…

We consider a general method for the approximation of the distribution of a process conditioned to not hit a given set. Existing methods are based on particle system that are failable, in the sense that, in many situations , they are not…

Consider a multidimensional diffusion process $X=\{X\left(t\right) :t\in\lbrack0,1]\}$. Let $\varepsilon>0$ be a \textit{deterministic}, user defined, tolerance error parameter. Under standard regularity conditions on the drift and…

The vast majority of convergence rates analysis for stochastic gradient methods in the literature focus on convergence in expectation, whereas trajectory-wise almost sure convergence is clearly important to ensure that any instantiation of…

Asymptotics deviation probabilities of the sum S n = X 1 + $\times$ $\times$ $\times$ + X n of independent and identically distributed real-valued random variables have been extensively investigated, in particular when X 1 is not…

Sampling from various kinds of distributions is an issue of paramount importance in statistics since it is often the key ingredient for constructing estimators, test procedures or confidence intervals. In many situations, the exact sampling…

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…

We study a random process with reinforcement, which evolves following the dynamics of a given diffusion process in a bounded domain and is resampled according to its occupation measure when it reaches the boundary. We show that its…

Diffusion approximation provides weak approximation for stochastic gradient descent algorithms in a finite time horizon. In this paper, we introduce new tools motivated by the backward error analysis of numerical stochastic differential…

An approximate maximum likelihood method of estimation of diffusion parameters $(\vartheta,\sigma)$ based on discrete observations of a diffusion $X$ along fixed time-interval $[0,T]$ and Euler approximation of integrals is analyzed. We…

The recent, impressive advances in algorithmic generation of high-fidelity image, audio, and video are largely due to great successes in score-based diffusion models. A key implementing step is score matching, that is, the estimation of the…

Score-based diffusion models, while achieving minimax optimality for sampling, are often hampered by slow sampling speeds due to the high computational burden of score function evaluations. Despite the recent remarkable empirical advances…

We describe a new, surprisingly simple algorithm, that simulates exact sample paths of a class of stochastic differential equations. It involves rejection sampling and, when applicable, returns the location of the path at a random…

Multidimensional continuous-time Markov jump processes $(Z(t))$ on $\mathbb{Z}^p$ form a usual set-up for modeling $SIR$-like epidemics. However, when facing incomplete epidemic data, inference based on $(Z(t))$ is not easy to be achieved.…

This paper studies a method, which has been proposed in the Physics literature by [8, 7, 10], for estimating the quasi-stationary distribution. In contrast to existing methods in eigenvector estimation, the method eliminates the need for…

This paper provides an elementary, self-contained analysis of diffusion-based sampling methods for generative modeling. In contrast to existing approaches that rely on continuous-time processes and then discretize, our treatment works…

Consider a non-symmetric generalized diffusion $X(\cdot)$ in ${\bbR}^d$ determined by the differential operator $A(\msx)=-\sum_{ij} \partial_ia_{ij}(\msx)\partial_j +\sum_i b_i(\msx)\partial_i$. In this paper the diffusion process is…

We present a deterministic $(1+o(1))$-approximation $(n^{1/2+o(1)}+D^{1+o(1)})$-time algorithm for solving the single-source shortest paths problem on distributed weighted networks (the CONGEST model); here $n$ is the number of nodes in the…