Crowdsourcing system has emerged as an effective platform for labeling data with relatively low cost by using non-expert workers. Inferring correct labels from multiple noisy answers on data, however, has been a challenging problem, since the quality of the answers varies widely across tasks and workers. Many existing works have assumed that there is a fixed ordering of workers in terms of their skill levels, and focused on estimating worker skills to aggregate the answers from workers with different weights. In practice, however, the worker skill changes widely across tasks, especially when the tasks are heterogeneous. In this paper, we consider a new model, called $d$-type specialization model, in which each task and worker has its own (unknown) type and the reliability of each worker can vary in the type of a given task and that of a worker. We allow that the number $d$ of types can scale in the number of tasks. In this model, we characterize the optimal sample complexity to correctly infer the labels within any given accuracy, and propose label inference algorithms achieving the order-wise optimal limit even when the types of tasks or those of workers are unknown. We conduct experiments both on synthetic and real datasets, and show that our algorithm outperforms the existing algorithms developed based on more strict model assumptions.
翻译:众包系统已成为使用非专家工人以相对低廉的成本标签数据的有效平台,但是,从对数据进行多次吵闹的回答中推断正确的标签是一个棘手的问题,因为答案的质量因任务和工人的不同而大不相同。许多现有工作假设工人按其技能水平有固定的顺序,并侧重于估计工人的技能,以汇总不同重量工人的答案。然而,在实践中,工人的技能在各任务之间大为变化,特别是在任务各不相同的情况下。在本文件中,我们考虑一种新的模式,称为美元类型的专门化模式,其中每个任务和工人都有自己的(未知的)类型,每个工人的可靠性在特定任务类型和工人的类别上都各不相同。我们允许按任务数量按比例计算各种类型的数字。在这个模型中,我们用最佳的样本复杂性来正确推算出任何给定的准确性标签,并提议标签推算法,即使在任务类型或工人的类别不明的情况下,也达到顺序最优的限度。我们根据更严格的合成和真实的算法进行了实验,我们基于更严格的合成和真实的算法的模型。