A Riemannian Primal-dual Algorithm Based on Proximal Operator and its Application in Metric Learning

Abstract

In this paper, we consider optimizing a smooth, convex, lower semicontinuous function in Riemannian space with constraints. To solve the problem, we first convert it to a dual problem and then propose a general primal-dual algorithm to optimize the primal and dual variables iteratively. In each optimization iteration, we employ a proximal operator to search optimal solution in the primal space. We prove convergence of the proposed algorithm and show its non-asymptotic convergence rate. By utilizing the proposed primal-dual optimization technique, we propose a novel metric learning algorithm which learns an optimal feature transformation matrix in the Riemannian space of positive definite matrices. Preliminary experimental results on an optimal fund selection problem in fund of funds (FOF) management for quantitative investment showed its efficacy.

arXiv comment8 pages, 2 figures, published as a conference paper in 2019 International Joint Conference on Neural Networks (IJCNN)

References in corpus (8)

• SAGA: A Fast Incremental Gradient Method With Support for Non-Strongly Convex Composite Objectives
• A Survey on Metric Learning for Feature Vectors and Structured Data
• Riemannian Adaptive Optimization Methods
• A new, globally convergent Riemannian conjugate gradient method
• Riemannian SVRG: Fast Stochastic Optimization on Riemannian Manifolds
• Riemannian stochastic variance reduced gradient algorithm with retraction and vector transport
• Geometric Mean Metric Learning
• Primal-Dual Optimization Algorithms over Riemannian Manifolds: an Iteration Complexity Analysis