An Efficient Sparse Metric Learning in High-Dimensional Space via L1-Penalized Log-Determinant Regularization

This paper proposes an efficient sparse metric learning algorithm in high dimensional space via an $\ell_1$-penalized log-determinant regularization. Compare to the most existing distance metric learn