mlsanityData to 7 Oct 2026

On stochastic gradient Langevin dynamics with dependent data streams: the fully non-convex case

arXiv 1905.13142 ↗First posted 30 May 2019math.ST math.PR stat.MLcited by 14

Not on the map. Why?

Abstract (arXiv)

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 analysis results are established in the L1-Wasserstein distance for the behaviour of Stochastic Gradient Langevin Dynamics (SGLD) algorithms. We allow the estimation of gradients to be performed even in the presence of dependent data streams. Our convergence estimates are sharper and uniform in the number of iterations, in contrast to those in previous studies.

Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). First posted on arXiv 30 May 2019.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2021: 4; 2022: 5; 2023: 2; 2024: 0; 2025: 2; 2026: 1.

14 papers.

Sort: