Semi-supervised learning and weakly supervised learning are important paradigms that aim to reduce the growing demand for labeled data in current machine learning applications. In this paper, we introduce a novel analysis of the classical label propagation algorithm (LPA) (Zhu & Ghahramani, 2002) that moreover takes advantage of useful prior information, specifically probabilistic hypothesized labels on the unlabeled data. We provide an error bound that exploits both the local geometric properties of the underlying graph and the quality of the prior information. We also propose a framework to incorporate multiple sources of noisy information. In particular, we consider the setting of weak supervision, where our sources of information are weak labelers. We demonstrate the ability of our approach on multiple benchmark weakly supervised classification tasks, showing improvements upon existing semi-supervised and weakly supervised methods.

本文中，我们介绍了一种更优的传统标签传播算法（LPA）的分析方法，它可以利用有用的先验信息，具体而言是无标签数据上的概率假设标签。我们提供了一个误差界限，它利用了底层图形的局部几何特性和先前信息的质量。我们还提出了一个框架来整合多个来源的嘈杂信息。我们在多个基准弱监督分类任务上演示了我们的方法的能力，并展示了对现有半监督和弱监督方法的改进。

弱监督下的标签传播