Approximate ranking from pairwise comparisons

Reinhard Heckel, Max Simchowitz, Kannan Ramchandran, Martin J. Wainwright

Abstract: A common problem in machine learning is to rank a set of n items based on pairwise comparison. Here, ranking refers to partitioning the items into sets of pre-specified sizes according to theirs sc...