Learning relative similarity by stochastic dual coordinate ascent

1Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

Learning relative similarity from pairwise instances is an important problem in machine learning and has a wide range of applications. Despite being studied for years, some existing methods solved by Stochastic Gradient Descent (SGD) techniques generally suffer from slow convergence. In this paper, we investigate the application of Stochastic Dual Coordinate Ascent (SDCA) technique to tackle the optimization task of relative similarity learning by extending from vector to matrix parameters. Theoretically, we prove the optimal linear convergence rate for the proposed SDCA algorithm, beating the well-known sublinear convergence rate by the previous best metric learning algorithms. Empirically, we conduct extensive experiments on both standard and large-scale data sets to validate the effectiveness of the proposed algorithm for retrieval tasks.

Cite

CITATION STYLE

APA

Wu, P., Ding, Y., Zhao, P., Miao, C., & Hoi, S. C. H. (2014). Learning relative similarity by stochastic dual coordinate ascent. In Proceedings of the National Conference on Artificial Intelligence (Vol. 3, pp. 2142–2148). AI Access Foundation. https://doi.org/10.1609/aaai.v28i1.9002

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free