Abstract
Gradient 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, dimension-free 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 approximation and the geometric ergodicity of the associated Markov chains.
| Original language | English |
|---|---|
| Pages (from-to) | 1356-1420 |
| Number of pages | 65 |
| Journal | Proceedings of Machine Learning Research |
| Volume | 178 |
| Publication status | Published - 1 Jan 2022 |
| Externally published | Yes |
| Event | 35th Conference on Learning Theory, COLT 2022 - Hybrid, London, United Kingdom Duration: 2 Jul 2022 → 5 Jul 2022 |
Fingerprint
Dive into the research topics of 'Dimension-free convergence rates for gradient Langevin dynamics in RKHS'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver