International audienceGradient Langevin dynamics (GLD) and stochastic GLD (SGLD) have attracted considerable attention lately, as a way to provide convergence guarantees in a non-convex setting. However, the known rates grow exponentially with the dimension of the space under the dissipative condition. In this work, we provide a convergence analysis of GLD and SGLD when the optimization space is an infinite-dimensional Hilbert space. More precisely, we derive non-asymptotic, dimensionfree convergence rates for GLD/SGLD when performing regularized non-convex optimization in a reproducing kernel Hilbert space. Amongst others, the convergence analysis relies on the properties of a stochastic differential equation, its discrete time Galerkin ap...
We present a probabilistic analysis of the long-time behaviour of the nonlocal, diffusive equations ...
Replica exchange stochastic gradient Langevin dynamics (reSGLD) has shown promise in accelerating th...
We consider minimizing a nonconvex, smooth function $f$ on a Riemannian manifold $\mathcal{M}$. We s...
International audienceGradient Langevin dynamics (GLD) and stochastic GLD (SGLD) have attracted cons...
We establish generalization error bounds for stochastic gradient Langevin dynamics (SGLD) with const...
The stochastic gradient Langevin Dynamics is one of the most fundamental algorithms to solve samplin...
In this paper, we are concerned with a non-asymptotic analysis of sampling algorithms used in noncon...
This thesis focuses on adaptive Stochastic Gradient Langevin Dynamics (SGLD) algorithms to solve opt...
Applying standard Markov chain Monte Carlo (MCMC) algorithms to large data sets is computationally e...
We establish a sharp uniform-in-time error estimate for the Stochastic Gradient Langevin Dynamics (S...
Applying standard Markov chain Monte Carlo (MCMC) algorithms to large data sets is computationally e...
In this paper, we study a method to sample from a target distribution $\pi$ over $\mathbb{R}^d$ hav...
International audienceIn this paper, we study a method to sample from a target distribution π over R...
94 pages, 4 figuresThis paper proposes a thorough theoretical analysis of Stochastic Gradient Descen...
In this paper, we explore a general Aggregated Gradient Langevin Dynamics framework (AGLD) for the M...
We present a probabilistic analysis of the long-time behaviour of the nonlocal, diffusive equations ...
Replica exchange stochastic gradient Langevin dynamics (reSGLD) has shown promise in accelerating th...
We consider minimizing a nonconvex, smooth function $f$ on a Riemannian manifold $\mathcal{M}$. We s...
International audienceGradient Langevin dynamics (GLD) and stochastic GLD (SGLD) have attracted cons...
We establish generalization error bounds for stochastic gradient Langevin dynamics (SGLD) with const...
The stochastic gradient Langevin Dynamics is one of the most fundamental algorithms to solve samplin...
In this paper, we are concerned with a non-asymptotic analysis of sampling algorithms used in noncon...
This thesis focuses on adaptive Stochastic Gradient Langevin Dynamics (SGLD) algorithms to solve opt...
Applying standard Markov chain Monte Carlo (MCMC) algorithms to large data sets is computationally e...
We establish a sharp uniform-in-time error estimate for the Stochastic Gradient Langevin Dynamics (S...
Applying standard Markov chain Monte Carlo (MCMC) algorithms to large data sets is computationally e...
In this paper, we study a method to sample from a target distribution $\pi$ over $\mathbb{R}^d$ hav...
International audienceIn this paper, we study a method to sample from a target distribution π over R...
94 pages, 4 figuresThis paper proposes a thorough theoretical analysis of Stochastic Gradient Descen...
In this paper, we explore a general Aggregated Gradient Langevin Dynamics framework (AGLD) for the M...
We present a probabilistic analysis of the long-time behaviour of the nonlocal, diffusive equations ...
Replica exchange stochastic gradient Langevin dynamics (reSGLD) has shown promise in accelerating th...
We consider minimizing a nonconvex, smooth function $f$ on a Riemannian manifold $\mathcal{M}$. We s...