arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2009.07360cs.LGcs.AIstat.ML
收藏

弱监督学习的约束标号

Constrained Labeling for Weakly Supervised Learning

Virginia Tech(弗吉尼亚理工大学);Tufts University(塔夫茨大学)

Chidubem Arachie, Bert Huang

摘要:

大型全监督数据集的管理已经成为机器学习的主要障碍之一。弱监督提供了一种替代监督学习的方法,通过使用来自不同来源的廉价、嘈杂且可能相关的标记函数进行训练。弱监督学习的关键挑战是结合不同的弱监督信号,同时导航错误中的误导性相关性。在本文中,我们提出了一种简单的无数据方法,通过定义一个约束空间的弱信号的可能标签和训练与随机标签在这个约束空间内结合弱监督信号。我们的方法是有效的和稳定的,收敛后的几个迭代的梯度下降。我们证明了理论条件下,随机标签的最坏情况下的错误减少的秩的线性约束。我们的实验表明,我们的方法优于其他弱监督方法在各种文本和图像分类任务。

英文摘要:

Curation of large fully supervised datasets has become one of the major roadblocks for machine learning. Weak supervision provides an alternative to supervised learning by training with cheap, noisy, and possibly correlated labeling functions from varying sources. The key challenge in weakly supervised learning is combining the different weak supervision signals while navigating misleading correlations in their errors. In this paper, we propose a simple data-free approach for combining weak supervision signals by defining a constrained space for the possible labels of the weak signals and training with a random labeling within this constrained space. Our method is efficient and stable, converging after a few iterations of gradient descent. We prove theoretical conditions under which the worst-case error of the randomized label decreases with the rank of the linear constraints. We show experimentally that our method outperforms other weak supervision methods on various text- and image-classification tasks.

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

↑