Riemannian stochastic quasi-Newton algorithm with variance reduction and its convergence analysis
원문 초록
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.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Efficient and Robust Freeway Traffic Speed Estimation under Oblique Grid using Vehicle Trajectory Data
Compressible Dynamics in Deep Overparameterized Low-Rank Learning & Adaptation
Randomized Approach to Matrix Completion: Applications in Collaborative Filtering and Image Inpainting
Linear Recursive Feature Machines provably recover low-rank matrices
Teaching Arithmetic to Small Transformers
GNMR: A provable one-line algorithm for low rank matrix recovery
토론
이 논문과 연결된 포럼 글이 아직 없습니다.