arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2103.02214cs.GT
收藏

有限任务数下的多任务节点预测

More Dominantly Truthful Multi-task Peer Prediction with a Finite Number of Tasks

Yuqing Kong

摘要:

在设置中,我们问参与者多个类似的可能主观的多项选择问题(例如,你喜欢Bulbasaur?你喜欢松鼠吗?是/否),同伴预测旨在设计鼓励诚实反馈而无需验证的机制。一系列的工作已经成功地设计了多任务的同行预测机制,如实报告是优于任何其他策略(占主导地位的真实),而他们需要无限数量的任务。最近的一项工作提出了第一个多任务对等预测机制,确定性互信息(互信息)机制,其中不仅是占主导地位的真实,但也适用于有限数量的任务(实用)。然而,是否存在其他实用的显性真实多任务同伴预测机制仍然是一个悬而未决的问题。这项工作回答了上述问题,提供1。一种新的信息-单调信息测度族:体积互信息(VMI),其中体积互信息是一种特殊情况; 2.一个新的家庭的实用主导真实的多任务同伴预测机制,VMI机制。为了说明VMI机制的重要性,我们还提供了一个易于处理的努力激励优化目标。我们表明,DMI机制可能不是最优的,但我们可以构建一个序列的VMI机制,近似最优的。本文的主要技术亮点是提出了一种新的几何信息度量--体积互信息,它基于一个简单的思想:我们可以用比A信息量少的物体的数量来度量A的信息量。物体上的不同密度导致不同的信息测量。这也给了行列式互信息一个简单的几何解释。

英文摘要:

In the setting where we ask participants multiple similar possibly subjective multi-choice questions (e.g. Do you like Bulbasaur? Y/N; do you like Squirtle? Y/N), peer prediction aims to design mechanisms that encourage honest feedback without verification. A series of works have successfully designed multi-task peer prediction mechanisms where reporting truthfully is better than any other strategy (dominantly truthful), while they require an infinite number of tasks. A recent work proposes the first multi-task peer prediction mechanism, Determinant Mutual Information (DMI)-Mechanism, where not only is dominantly truthful but also works for a finite number of tasks (practical). However, the existence of other practical dominantly-truthful multi-task peer prediction mechanisms remains to be an open question. This work answers the above question by providing 1. a new family of information-monotone information measures: volume mutual information (VMI), where DMI is a special case; 2. a new family of practical dominantly-truthful multi-task peer prediction mechanisms, VMI-Mechanisms. To illustrate the importance of VMI-Mechanisms, we also provide a tractable effort incentive optimization goal. We show that DMI-Mechanism may not be not optimal but we can construct a sequence of VMI-Mechanisms that are approximately optimal. The main technical highlight in this paper is a novel geometric information measure, Volume Mutual Information, that is based on a simple idea: we can measure an object A's information amount by the number of objects that is less informative than A. Different densities over the object lead to different information measures. This also gives Determinant Mutual Information a simple geometric interpretation.

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

↑