资源论文Fantope Regularization in Metric Learning

Fantope Regularization in Metric Learning

2019-12-12 | |  90 |   66 |   0

Abstract

This paper introduces a regularization method to ex-plicitly control the rank of a learned symmetric positivesemidefinite distance matrix in distance metric learning. Tothis end, we propose to incorporate in the objective functiona linear regularization term that minimizes the k smallesteigenvalues of the distance matrix. It is equivalent to min-imizing the trace of the product of the distance matrix witha matrix in the convex hull of rank-k projection matrices,called a Fantope. Based on this new regularization method,we derive an optimization scheme to efficiently learn the distance matrix. We demonstrate the effectiveness of the method on synthetic and challenging real datasets of face verification and image classification with relative attributes,on which our method outperforms state-of-the-art metric learning algorithms.

上一篇:Bregman Divergences for Infinite Dimensional Covariance Matrices

下一篇:MILCut: A Sweeping Line Multiple Instance Learning Paradigm for Interactive Image Segmentation

用户评价
全部评价

热门资源

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Hierarchical Task...

    We extend hierarchical task network planning wi...

  • Shape-based Autom...

    We present an algorithm for automatic detection...