0


远程度量学习的快速求解和有效实现

Fast Solvers and Efficient Implementations for Distance Metric Learning
课程网址: http://videolectures.net/icml08_weinberger_fse/  
主讲教师: Kilian Weinberger
开课单位: 康奈尔大学
开课时间: 2008-08-05
课程语种: 英语
中文简介:
在本文中,我们研究如何通过学习马哈拉诺比斯距离度量来改进最近邻分类。我们建立在最近提出的距离度量学习框架上,称为大边缘最近邻居(LMNN)分类。在此框架内,我们专注于大型数据集带来的可扩展性和适应性方面的挑战。我们的论文做了三个贡献。首先,我们描述了一个高效求解器,用于LMNN分类中出现的半定规划的特定实例;我们的求解器可以在几个小时内处理数十亿大边界约束的问题。其次,我们展示了如何使用公制球树减少训练和测试时间;通过学习输入空间的低维表示,进一步放大了来自球树的加速。第三,我们展示了如何在输入空间的不同部分学习不同的马哈拉诺比斯距离度量。对于大型数据集,这些局部自适应度量的混合导致更低的错误率。
课程简介: In this paper we study how to improve nearest neighbor classification by learning a Mahalanobis distance metric. We build on a recently proposed framework for distance metric learning known as large margin nearest neighbor (LMNN) classification. Within this framework, we focus specifically on the challenges in scalability and adaptability posed by large data sets. Our paper makes three contributions. First, we describe a highly efficient solver for the particular instance of semidefinite programming that arises in LMNN classification; our solver can handle problems with billions of large margin constraints in a few hours. Second, we show how to reduce both training and testing times using metric ball trees; the speedups from ball trees are further magnified by learning low dimensional representations of the input space. Third, we show how to learn different Mahalanobis distance metrics in different parts of the input space. For large data sets, these mixtures of locally adaptive metrics lead to even lower error rates.
关 键 词: 最近邻分类; 数据集; 求解器
课程来源: 视频讲座网
最后编审: 2019-04-21:lxf
阅读次数: 97