arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 1303.1271cs.LG
收藏

凸可伸缩的弱标记支持向量机

Convex and Scalable Weakly Labeled SVMs

Nanjing University(南京大学);Nanyang Technological University(南洋理工大学);Hong Kong University of Science & Technology(香港科技大学)

Yu-Feng Li, Ivor W. Tsang, James T. Kwok, Zhi-Hua Zhou

摘要:

在本文中,我们研究了弱标记数据的学习问题,其中的训练样本的标签是不完整的。这包括,例如,(i)标签部分已知的半监督学习;(ii)标签隐含已知的多实例学习;以及(iii)标签完全未知的聚类。与监督学习不同,弱标签学习涉及困难的混合编程(MIP)问题。因此,它的可扩展性很差,也可能陷入局部最小值。在本文中,我们专注于支持向量机,并提出了WellSVM通过一种新的标签生成策略。这导致原始MIP的凸松弛,其至少与现有凸半定规划(SDP)松弛一样紧。此外,WellSVM可以通过一系列SVM子问题来解决,这些子问题比以前的凸SDP松弛更具可扩展性。在三个弱标记学习任务上的实验,即(i)半监督学习;(ii)基于内容的信息检索中定位感兴趣区域的多示例学习;以及(iii)聚类,清楚地表明了改进的性能,并且WellSVM也很容易适用于大数据集。

英文摘要:

In this paper, we study the problem of learning from weakly labeled data, where labels of the training examples are incomplete. This includes, for example, (i) semi-supervised learning where labels are partially known; (ii) multi-instance learning where labels are implicitly known; and (iii) clustering where labels are completely unknown. Unlike supervised learning, learning with weak labels involves a difficult Mixed-Integer Programming (MIP) problem. Therefore, it can suffer from poor scalability and may also get stuck in local minimum. In this paper, we focus on SVMs and propose the WellSVM via a novel label generation strategy. This leads to a convex relaxation of the original MIP, which is at least as tight as existing convex Semi-Definite Programming (SDP) relaxations. Moreover, the WellSVM can be solved via a sequence of SVM subproblems that are much more scalable than previous convex SDP relaxations. Experiments on three weakly labeled learning tasks, namely, (i) semi-supervised learning; (ii) multi-instance learning for locating regions of interest in content-based information retrieval; and (iii) clustering, clearly demonstrate improved performance, and WellSVM is also readily applicable on large data sets.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑