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.
| Translated title of the contribution | Sparse Metric Learning via Smooth Optimization |
|---|---|
| Original language | English |
| Title of host publication | Advances in Neural Information Processing Systems 22: 23rd Annual Conference on Neural Information Processing Systems 2009. Proceedings of a meeting held 7-10 December 2009, Vancouver, British Columbia, Canada |
| Subtitle of host publication | NIPS 22 |
| Editors | Yoshua Bengio, Dale Schuurmans, John D. Lafferty, Christopher K.I. Williams, Aron Culotta |
| Publisher | Curran Associates, Inc |
| Pages | 2214 - 2222 |
| Number of pages | 8 |
| Volume | 22 |
| ISBN (Electronic) | 9781615679119 |
| Publication status | Published - 2009 |
Publication series
| Name | Neural Information Processing Systems (NIPS) |
|---|
Bibliographical note
Name and Venue of Event: Vancouver, CanadaConference Proceedings/Title of Journal: Advances in Neural Information Processing Systems Conference Organiser: NIPS Foundation
Keywords
- metric
- learning
- sparse
Fingerprint
Dive into the research topics of 'Sparse Metric Learning via Smooth Optimization'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver