Convergence Analysis of Riemannian Stochastic Approximation Schemes
arXiv:2005.13284
Abstract
This paper analyzes the convergence for a large class of Riemannian stochastic approximation (SA) schemes, which aim at tackling stochastic optimization problems. In particular, the recursions we study use either the exponential map of the considered manifold (geodesic schemes) or more general retraction functions (retraction schemes) used as a proxy for the exponential map. Such approximations are of great interest since they are low complexity alternatives to geodesic schemes. Under the assumption that the mean field of the SA is correlated with the gradient of a smooth Lyapunov function (possibly non-convex), we show that the above Riemannian SA schemes find an -stationary point (in expectation) within iterations, where is the asymptotic bias. Compared to previous works, the conditions we derive are considerably milder. First, all our analysis are global as we do not assume iterates to be a-priori bounded. Second, we study biased SA schemes. To be more specific, we consider the case where the mean-field function can only be estimated up to a small bias, and/or the case in which the samples are drawn from a controlled Markov chain. Third, the conditions on retractions required to ensure convergence of the related SA schemes are weak and hold for well-known examples. We illustrate our results on three machine learning problems.
41 pages, 2 figures
References in corpus (6)
- Continuous Hierarchical Representations with Poincaré Variational Auto-Encoders
- Averaging Stochastic Gradient Descent on Riemannian Manifolds
- Efficiently escaping saddle points on manifolds
- R-SPIDER: A Fast Riemannian Stochastic Optimization Algorithm with Curvature Independent Rate
- Non-asymptotic Analysis of Biased Stochastic Approximation Scheme
- Escaping from saddle points on Riemannian manifolds