Related papers: Self-normalized Cram\'er-type Moderate Deviation o…
In this paper, we establish normalized and self-normalized Cram\'er-type moderate deviations for Euler-Maruyama scheme for SDE. As a consequence of our results, Berry-Esseen's bounds and moderate deviation principles are also obtained. Our…
We consider a stochastic differential equation and its Euler-Maruyama (EM) scheme, under some appropriate conditions, they both admit a unique invariant measure, denoted by $\pi$ and $\pi_\eta$ respectively ($\eta$ is the step size of the…
Stochastic Gradient Langevin Dynamics (SGLD) is a sampling scheme for Bayesian modeling adapted to large datasets and models. SGLD relies on the injection of Gaussian Noise at each step of a Stochastic Gradient Descent (SGD) update. In this…
We derive Cram\'{e}r type moderate deviations for stationary sequences of bounded random variables. Our results imply the moderate deviation principles and a Berry-Esseen bound. Applications to quantile coupling inequalities, functions of…
Let $(Z_n)_{n\geq0}$ be a supercritical Galton-Watson process. Consider the Lotka-Nagaev estimator for the offspring mean. In this paper, we establish self-normalized Cram\'{e}r type moderate deviations and Berry-Esseen's bounds for the…
In this paper, we study the self-normalized Cram\a'{e}r-type moderate deviations for centered independent random variables $X_1, X_2,...$ with $0<E |X_i|^3 <\infty$. The main results refine Theorems 1.1 and 1.2 of Wang (2011), the…
Stochastic Gradient Descent (SGD) is commonly modeled as a Langevin process, assuming that minibatch noise acts as Brownian motion. However, this approximation relies on a continuous-time limit and a sqrt(eta) noise scaling that does not…
Cram\'er's moderate deviations give a quantitative estimate for the relative error of the normal approximation and provide theoretical justifications for many estimator used in statistics. In this paper, we establish self-normalized…
We propose an adaptively weighted stochastic gradient Langevin dynamics algorithm (SGLD), so-called contour stochastic gradient Langevin dynamics (CSGLD), for Bayesian learning in big data statistics. The proposed algorithm is essentially a…
Let $(g_{n})_{n\geq 1}$ be a sequence of independent and identically distributed (i.i.d.) $d\times d$ real random matrices. For $n\geq 1$ set $G_n = g_n \ldots g_1$. Given any starting point $x=\mathbb R v\in\mathbb{P}^{d-1}$, consider the…
Stochastic gradient Langevin dynamics (SGLD) is a computationally efficient sampler for Bayesian posterior inference given a large scale dataset. Although SGLD is designed for unbounded random variables, many practical models incorporate…
Continuous-time models provide important insights into the training dynamics of optimization algorithms in deep learning. In this work, we establish a non-asymptotic convergence analysis of stochastic gradient Langevin dynamics (SGLD),…
Applying standard Markov chain Monte Carlo (MCMC) algorithms to large data sets is computationally infeasible. The recently proposed stochastic gradient Langevin dynamics (SGLD) method circumvents this problem in three ways: it generates…
Stochastic Gradient Langevin Dynamics (SGLD) is a popular variant of Stochastic Gradient Descent, where properly scaled isotropic Gaussian noise is added to an unbiased estimate of the gradient at each iteration. This modest change allows…
Langevin algorithms are popular Markov Chain Monte Carlo methods for Bayesian learning, particularly when the aim is to sample from the posterior distribution of a parametric model, given the input data and the prior distribution over the…
This paper develops asymptotic theory for quantile estimation via stochastic gradient descent (SGD) with a constant learning rate. The quantile loss function is neither smooth nor strongly convex. Beyond conventional perspectives and…
We develop generalization error bounds for stochastic gradient descent (SGD) with label noise in non-convex settings under uniform dissipativity and smoothness conditions. Under a suitable choice of semimetric, we establish a contraction in…
We introduce the spatial disorder-generalized Langevin equation (SD-GLE), a data-driven method for constructing coarse-grained (CG) dynamics in heterogeneous systems. Unlike conventional CG approaches that rely on a mean-field potential,…
We consider the problem of sampling from a target distribution, which is \emph {not necessarily logconcave}, in the context of empirical risk minimization and stochastic optimization as presented in Raginsky et al. (2017). Non-asymptotic…
We establish a sharp uniform-in-time error estimate for the Stochastic Gradient Langevin Dynamics (SGLD), which is a widely-used sampling algorithm. Under mild assumptions, we obtain a uniform-in-time $O(\eta^2)$ bound for the KL-divergence…