arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1202.3726cs.LGstat.ML
收藏

基于次模函数的主动半监督学习

Active Semi-Supervised Learning using Submodular Functions

University of Washington(华盛顿大学)

Andrew Guillory, Jeff A. Bilmes

摘要:

我们认为主动,半监督学习在离线转导设置。我们表明,以前提出的错误界主动学习无向加权图可以推广取代图割任意对称子模函数。任意非对称子模函数都可以通过对称化来使用。子模函数的不同选择给出了适用于不同类型问题的不同版本的误差界。此外,界限是确定性的,并保持对立选择的标签。我们证明了精确地最小化这个误差界是NP完全的。然而,我们还介绍了任何子模块功能的相关的主动半监督学习方法,近似最小化相应的误差界。我们表明,误差界是紧的意义上说,没有其他相同形式的界是更好的。我们的理论结果得到了实际数据实验的支持。

英文摘要:

We consider active, semi-supervised learning in an offline transductive setting. We show that a previously proposed error bound for active learning on undirected weighted graphs can be generalized by replacing graph cut with an arbitrary symmetric submodular function. Arbitrary non-symmetric submodular functions can be used via symmetrization. Different choices of submodular functions give different versions of the error bound that are appropriate for different kinds of problems. Moreover, the bound is deterministic and holds for adversarially chosen labels. We show exactly minimizing this error bound is NP-complete. However, we also introduce for any submodular function an associated active semi-supervised learning method that approximately minimizes the corresponding error bound. We show that the error bound is tight in the sense that there is no other bound of the same form which is better. Our theoretical results are supported by experiments on real data.

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

↑