On the stability of the stochastic gradient Langevin algorithm with dependent data stream
Not on the map. Why?
Abstract (arXiv)
We prove, under mild conditions, that the stochastic gradient Langevin dynamics converges to a limiting law as time tends to infinity, even in the case where the driving data sequence is dependent.
Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). First posted on arXiv 4 May 2021.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026DC-LA: Difference-of-Convex Langevin Algorithmcited by 1
- 2026DC-LA: Difference-of-Convex Langevin Algorithm30 Jan 2026