Résumé
This paper studies fixed step-size stochastic approximation (SA) schemes, including stochastic gradient schemes, in a Riemannian framework. It is motivated by several applications, where geodesics can be computed explicitly, and their use accelerates crude Euclidean methods. A fixed step-size scheme defines a family of time-homogeneous Markov chains, parametrized by the step-size. Here, using this formulation, non-asymptotic performance bounds are derived, under Lyapunov conditions. Then, for any step-size, the corresponding Markov chain is proved to admit a unique stationary distribution, and to be geometrically ergodic. This result gives rise to a family of stationary distributions indexed by the step-size, which is further shown to converge to a Dirac measure, concentrated at the solution of the problem at hand, as the step-size goes to 0. Finally, the asymptotic rate of this convergence is established, through an asymptotic expansion of the bias, and a central limit theorem.
| langue originale | Anglais |
|---|---|
| Pages (de - à) | 1018-1026 |
| Nombre de pages | 9 |
| journal | Proceedings of Machine Learning Research |
| Volume | 130 |
| état | Publié - 1 janv. 2021 |
| Evénement | 24th International Conference on Artificial Intelligence and Statistics, AISTATS 2021 - Virtual, Online, États-Unis Durée: 13 avr. 2021 → 15 avr. 2021 |
Empreinte digitale
Examiner les sujets de recherche de « On Riemannian Stochastic Approximation Schemes with Fixed Step-Size ». Ensemble, ils forment une empreinte digitale unique.Contient cette citation
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver