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

众包模型中的错误率界

Error Rate Bounds in Crowdsourcing Models

UC Berkeley(加州大学伯克利分校);Microsoft Research(微软研究院)

Hongwei Li, Bin Yu, Dengyong Zhou

摘要:

众包是一种有效的工具,人力计算的许多任务的挑战,计算机。在本文中,我们提供了有限样本指数界的错误率(概率和期望)的超平面二进制标记规则下的Dawid-Skene众包模型。该界可用于分析许多常见的预测方法,包括多数投票和加权多数投票。这些结果对于控制错误率和设计更好的算法有一定的参考价值。我们发现,Oracle最大后验(MAP)规则近似优化了我们的上界的平均错误率为任何超平面二进制标记规则,并提出了一个简单的数据驱动的加权多数表决(WMV)规则(称为一步WMV),试图近似的Oracle MAP,并有一个可证明的理论保证的错误率。此外,我们使用模拟和真实的数据来证明,数据驱动的EM-MAP规则是一个很好的近似的Oracle MAP规则,并证明,数据驱动的EM-MAP规则的平均错误率也有界的Oracle MAP规则的平均错误率界估计参数插入到界。

英文摘要:

Crowdsourcing is an effective tool for human-powered computation on many tasks challenging for computers. In this paper, we provide finite-sample exponential bounds on the error rate (in probability and in expectation) of hyperplane binary labeling rules under the Dawid-Skene crowdsourcing model. The bounds can be applied to analyze many common prediction methods, including the majority voting and weighted majority voting. These bound results could be useful for controlling the error rate and designing better algorithms. We show that the oracle Maximum A Posterior (MAP) rule approximately optimizes our upper bound on the mean error rate for any hyperplane binary labeling rule, and propose a simple data-driven weighted majority voting (WMV) rule (called one-step WMV) that attempts to approximate the oracle MAP and has a provable theoretical guarantee on the error rate. Moreover, we use simulated and real data to demonstrate that the data-driven EM-MAP rule is a good approximation to the oracle MAP rule, and to demonstrate that the mean error rate of the data-driven EM-MAP rule is also bounded by the mean error rate bound of the oracle MAP rule with estimated parameters plugging into the bound.

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

↑