Résumé
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.
| langue originale | Anglais |
|---|---|
| Pages (de - à) | 1356-1420 |
| Nombre de pages | 65 |
| journal | Proceedings of Machine Learning Research |
| Volume | 178 |
| état | Publié - 1 janv. 2022 |
| Modification externe | Oui |
| Evénement | 35th Conference on Learning Theory, COLT 2022 - Hybrid, London, Royaume-Uni Durée: 2 juil. 2022 → 5 juil. 2022 |
Empreinte digitale
Examiner les sujets de recherche de « Dimension-free convergence rates for gradient Langevin dynamics in RKHS ». Ensemble, ils forment une empreinte digitale unique.Contient cette citation
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver