Skip to Main content Skip to Navigation
New interface
Conference papers

Sparse Compositional Metric Learning

Abstract : We propose a new approach for metric learning by framing it as learning a sparse combination of locally discriminative metrics that are inexpensive to generate from the training data. This flexible framework allows us to naturally derive formulations for global, multi-task and local metric learning. The resulting algorithms have several advantages over existing methods in the literature: a much smaller number of parameters to be estimated and a principled way to generalize learned met-rics to new testing data points. To analyze the approach theoretically, we derive a generalization bound that justifies the sparse combination. Empirically, we evaluate our algorithms on several datasets against state-of-the-art metric learning methods. The results are consistent with our theoretical findings and demonstrate the superiority of our approach in terms of classification performance and scalability.
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Aurélien Bellet Connect in order to contact the contributor
Submitted on : Thursday, January 12, 2017 - 2:04:03 PM
Last modification on : Tuesday, September 10, 2019 - 11:32:02 AM
Long-term archiving on: : Friday, April 14, 2017 - 11:46:02 AM


Files produced by the author(s)


  • HAL Id : hal-01430847, version 1


Yuan Shi, Aurélien Bellet, Fei Sha. Sparse Compositional Metric Learning. AAAI Conference on Artificial Intelligence (AAAI 2014), Jul 2014, Quebec City, Canada. ⟨hal-01430847⟩



Record views


Files downloads