arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1806.08182cs.DScs.DBcs.LG
收藏

噪声值和比较模型中的实例最优性-接受,接受,强接受:哪些论文入选?

Instance-Optimality in the Noisy Value-and Comparison-Model --- Accept, Accept, Strong Accept: Which Papers get in?

CNRS(法国国家科学研究中心);Sorbonne Université(索邦大学);MIT(麻省理工学院)

Vincent Cohen-Addad, Frederik Mallmann-Trenn, Claire Mathieu

摘要:

受众包计算,同行评分和推荐系统的启发,Braverman,Mao和Weinberg [STOC'16]研究了基本问题的\emph{query}和\emph{round}复杂性,例如找到最大值(\textsc{max}),找到高于某个值的所有元素(\textsc{threshold-$v$})或在嘈杂环境中计算顶级$-k$元素(\textsc{Top} - $k$)。例如,考虑为会议选择论文的任务。这项任务具有挑战性,因为同行审评具有众包性质:审评结果嘈杂,必须尽可能使审评进程并行化。我们研究了噪声值模型和噪声比较模型:在\emph{noisy value model}中,评审员被要求评估一个单一的元素:“论文$i$的价值是什么?“(PDMATHAMV接受)。在\emph{noisy comparison model}(在Feige,Peleg,Raghavan和Upfal的开创性工作[SICOMP'94]中介绍)中,要求评审员进行成对比较:“论文$i$优于论文$j$吗?“在本文中,我们展示了\textsc{max}、\textsc{threshold-$v$}和\textsc{Top} - $k$问题的最优最坏情况查询复杂度。对于\textsc{max}和\textsc{Top} - $k$,我们得到了最优的最坏情况下的上界和下界的轮与查询复杂度在这两个模型。对于\textsc{threshold} - $v$,我们获得了两个模型的最优查询复杂度和接近最优的轮复杂度,其中$k$是输出的大小。然后,我们超越了最坏的情况下,并解决问题的知识的实例的重要性,提供了一个大范围的参数,实例优化算法的查询复杂性。此外,我们证明了价值模型比比较模型严格更容易。

英文摘要:

Motivated by crowdsourced computation, peer-grading, and recommendation systems, Braverman, Mao and Weinberg [STOC'16] studied the \emph{query} and \emph{round} complexity of fundamental problems such as finding the maximum (\textsc{max}), finding all elements above a certain value (\textsc{threshold-$v$}) or computing the top$-k$ elements (\textsc{Top}-$k$) in a noisy environment. For example, consider the task of selecting papers for a conference. This task is challenging due the crowdsourcing nature of peer reviews: the results of reviews are noisy and it is necessary to parallelize the review process as much as possible. We study the noisy value model and the noisy comparison model: In the \emph{noisy value model}, a reviewer is asked to evaluate a single element: "What is the value of paper $i$?" (\eg accept). In the \emph{noisy comparison model} (introduced in the seminal work of Feige, Peleg, Raghavan and Upfal [SICOMP'94]) a reviewer is asked to do a pairwise comparison: "Is paper $i$ better than paper $j$?" In this paper, we show optimal worst-case query complexity for the \textsc{max},\textsc{threshold-$v$} and \textsc{Top}-$k$ problems. For \textsc{max} and \textsc{Top}-$k$, we obtain optimal worst-case upper and lower bounds on the round vs query complexity in both models. For \textsc{threshold}-$v$, we obtain optimal query complexity and nearly-optimal round complexity, where $k$ is the size of the output) for both models. We then go beyond the worst-case and address the question of the importance of knowledge of the instance by providing, for a large range of parameters, instance-optimal algorithms with respect to the query complexity. Furthermore, we show that the value model is strictly easier than the comparison model.

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

↑