Learning relative similarity by stochastic dual coordinate ascent

• Main Authors: WU, Pengcheng, YI, Ding, ZHAO, Peilin, MIAO, Chunyan, HOI, Steven C. H.
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2014
• Subjects: distance metric learning; similarity learning; online learning; retrieval; Computer Sciences; Databases and Information Systems; Numerical Analysis and Scientific Computing
• Online Access: https://ink.library.smu.edu.sg/sis_research/2321; https://ink.library.smu.edu.sg/context/sis_research/article/3321/viewcontent/8415_38543_1_PB.pdf
• Institution: Singapore Management University

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.