Reinhard Heckel, Max Simchowitz, Kannan Ramchandran, Martin J. Wainwright
TL;DR研究在机器学习中,基于两两比较对一组 n 个项目进行排名的问题,提出了一种基于置信区间的活跃排名算法,通过近似排序来减少比较次数。
Abstract
A common problem in machine learning is to rank a set of n items based on
pairwise comparisons. Here ranking refers to partitioning the items into sets
of pre-specified sizes according to their scores, which incl