pith. sign in

arxiv: 1703.04890 · v3 · pith:FIZF6W53new · submitted 2017-03-15 · 💻 cs.LG · cs.NA· math.NA· math.OC· stat.ML

Riemannian stochastic quasi-Newton algorithm with variance reduction and its convergence analysis

classification 💻 cs.LG cs.NAmath.NAmath.OCstat.ML
keywords algorithmstochasticreductionriemannianvariancealgorithmsconvergencefunctions
0
0 comments X
read the original abstract

Stochastic variance reduction algorithms have recently become popular for minimizing the average of a large, but finite number of loss functions. The present paper proposes a Riemannian stochastic quasi-Newton algorithm with variance reduction (R-SQN-VR). The key challenges of averaging, adding, and subtracting multiple gradients are addressed with notions of retraction and vector transport. We present convergence analyses of R-SQN-VR on both non-convex and retraction-convex functions under retraction and vector transport operators. The proposed algorithm is evaluated on the Karcher mean computation on the symmetric positive-definite manifold and the low-rank matrix completion on the Grassmann manifold. In all cases, the proposed algorithm outperforms the state-of-the-art Riemannian batch and stochastic gradient algorithms.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.