Stochastic Dykstra Algorithms for Metric Learning on Positive Semi-Definite Cone

Abstract

Recently, covariance descriptors have received much attention as powerful representations of set of points. In this research, we present a new metric learning algorithm for covariance descriptors based on the Dykstra algorithm, in which the current solution is projected onto a half-space at each iteration, and runs at O(n^3) time. We empirically demonstrate that randomizing the order of half-spaces in our Dykstra-based algorithm significantly accelerates the convergence to the optimal solution. Furthermore, we show that our approach yields promising experimental results on pattern recognition tasks.

References in corpus (4)

• A Stochastic Gradient Method with an Exponential Convergence Rate for Finite Training Sets
• Finito: A Faster, Permutable Incremental Gradient Method for Big Data Problems
• Riemannian Metric Learning for Symmetric Positive Definite Matrices
• Supervised LogEuclidean Metric Learning for Symmetric Positive Definite Matrices