PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Sparse Metric Learning via Smooth Optimization
Yiming Ying, Kaizhu Huang and Colin Campbell
In: NIPS 2009, 7-12 DEC 2009, Vancouver, Canada.

Abstract

In this paper we study the problem of learning a low-rank (sparse) distance matrix. We propose a novel metric learning model which can simultaneously conduct dimension reduction and learn a distance matrix. The sparse representation involves a mixed-norm regularization which is non-convex. We then show that it can be equivalently formulated as a convex saddle (min-max) problem. From this saddle representation, we develop an efficient smooth optimization approach [17] for sparse metric learning, although the learning model is based on a nondifferentiable loss function. Finally, we run experiments to validate the effectiveness and efficiency of our sparse metric learning model on various datasets.

EPrint Type:Conference or Workshop Item (Paper)
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Computational, Information-Theoretic Learning with Statistics
Learning/Statistics & Optimisation
Theory & Algorithms
ID Code:5521
Deposited By:Yiming Ying
Deposited On:16 January 2010