Partial recovery for top-k ranking: Optimality of MLE and SubOptimality of the spectral method
前 k 名排序的部分恢复:极大似然最优性与谱方法的次优性
Given partially observed pairwise comparison data generated by the Bradley–Terry–Luce (BTL) model, we study the problem of top-k ranking. That is, to optimally identify the set of top-k players. We derive the minimax rate with respect to a normalized Hamming loss. This provides the first result in the literature that characterizes the partial recovery error in terms of the proportion of mistakes for top-k ranking. We also derive the optimal signal to noise ratio condition…