将众包减少到Graphon估计,统计学上
Reducing Crowdsourcing to Graphon Estimation, Statistically
摘要:
以无监督的方式基于多个嘈杂的答案推断二元任务的正确答案已经成为微任务众包或更一般地聚合意见的典型问题。在图子估计中,人们感兴趣的是使用图实现的单个快照来估计节点之间的边缘强度或概率。在最近的文献中,这两个主题都有令人兴奋的发展。在众包的背景下,关键的智力挑战是了解是否可以通过聚合从其他不同任务收集的答案来更准确地对给定任务进行降噪。在图子估计的背景下,精确的信息限制和估计算法仍然感兴趣。在本文中,我们利用从众包到图子估计的统计减少来推进这两个挑战的最新技术。我们使用的概念,从图子估计设计一个算法,实现更好的性能比{ \em多数表决}计划的设置,超越了在文献中考虑的{ \em秩一}模型。我们使用已知的明确的众包下限,以提供精细的图子估计的下限。
英文摘要:
Inferring the correct answers to binary tasks based on multiple noisy answers in an unsupervised manner has emerged as the canonical question for micro-task crowdsourcing or more generally aggregating opinions. In graphon estimation, one is interested in estimating edge intensities or probabilities between nodes using a single snapshot of a graph realization. In the recent literature, there has been exciting development within both of these topics. In the context of crowdsourcing, the key intellectual challenge is to understand whether a given task can be more accurately denoised by aggregating answers collected from other different tasks. In the context of graphon estimation, precise information limits and estimation algorithms remain of interest. In this paper, we utilize a statistical reduction from crowdsourcing to graphon estimation to advance the state-of-art for both of these challenges. We use concepts from graphon estimation to design an algorithm that achieves better performance than the {\em majority voting} scheme for a setup that goes beyond the {\em rank one} models considered in the literature. We use known explicit lower bounds for crowdsourcing to provide refined lower bounds for graphon estimation.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。