arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2111.13621cs.IRcs.DS
收藏

锦标赛图中寻找冠军的最优算法

An Optimal Algorithm for Finding Champions in Tournament Graphs

Lorenzo Beretta, Franco Maria Nardini, Roberto Trani, Rossano Venturini

AI总结:

本文研究锦标赛图中寻找冠军的最优算法,证明任何算法需 $Ω(\ell n)$ 次比较,并提出达到该下界的渐近最优确定性算法,在问答任务上实现最高 $13\times$ 的检索加速。

摘要:

锦标赛图是一个完全有向图,可用于建模 $n$ 名选手之间的循环赛。在本文中,我们研究寻找锦标赛冠军(也称为 Copeland 胜者)的问题,即赢得最多比赛的选手。具体而言,我们旨在研究通过进行少量比赛来找到冠军的算法。解决这一问题可以加速多个信息检索和推荐系统应用,包括问答、对话式搜索等。实际上,这些应用通常通过使用机器学习模型来估计每对选手之间谁获胜,从而在选手之间诱导出一场循环赛来寻找冠军。因此,我们的贡献在于能够通过执行少量模型推理来找到冠军。我们证明,任何以恒定成功概率找到冠军的确定性算法或随机化算法都需要 $Ω(\ell n)$ 次比较,其中 $\ell$ 是冠军输掉的比赛数。随后,我们提出了一种渐近最优的确定性算法,在不知道 $\ell$ 的情况下达到该下界,并将我们的分析扩展到该问题的三个变体。最后,我们在公开数据的问答任务上对所提算法进行了全面的实验评估。结果表明,与执行完整锦标赛的最新算法相比,我们提出的算法将冠军检索速度提高了最多 $13\times$。

英文摘要:

A tournament graph is a complete directed graph, which can be used to model a round-robin tournament between $n$ players. In this paper, we address the problem of finding a champion of the tournament, also known as Copeland winner, which is a player that wins the highest number of matches. In detail, we aim to investigate algorithms that find the champion by playing a low number of matches. Solving this problem allows us to speed up several Information Retrieval and Recommender System applications, including question answering, conversational search, etc. Indeed, these applications often search for the champion inducing a round-robin tournament among the players by employing a machine learning model to estimate who wins each pairwise comparison. Our contribution, thus, allows finding the champion by performing a low number of model inferences. We prove that any deterministic or randomized algorithm finding a champion with constant success probability requires $Ω(\ell n)$ comparisons, where $\ell$ is the number of matches lost by the champion. We then present an asymptotically-optimal deterministic algorithm matching this lower bound without knowing $\ell$, and we extend our analysis to three variants of the problem. Lastly, we conduct a comprehensive experimental assessment of the proposed algorithms on a question answering task on public data. Results show that our proposed algorithms speed up the retrieval of the champion up to $13\times$ with respect to the state-of-the-art algorithm that perform the full tournament.

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

↑