Spectral MLE: Top-K Rank Aggregation from Pairwise Comparisons

04/27/2015
by   Yuxin Chen, et al.
0

This paper explores the preference-based top-K rank aggregation problem. Suppose that a collection of items is repeatedly compared in pairs, and one wishes to recover a consistent ordering that emphasizes the top-K ranked items, based on partially revealed preferences. We focus on the Bradley-Terry-Luce (BTL) model that postulates a set of latent preference scores underlying all items, where the odds of paired comparisons depend only on the relative scores of the items involved. We characterize the minimax limits on identifiability of top-K ranked items, in the presence of random and non-adaptive sampling. Our results highlight a separation measure that quantifies the gap of preference scores between the K^th and (K+1)^th ranked items. The minimum sample complexity required for reliable top-K ranking scales inversely with the separation measure irrespective of other preference distribution metrics. To approach this minimax limit, we propose a nearly linear-time ranking scheme, called Spectral MLE, that returns the indices of the top-K items in accordance to a careful score estimate. In a nutshell, Spectral MLE starts with an initial score estimate with minimal squared loss (obtained via a spectral method), and then successively refines each component with the assistance of coordinate-wise MLEs. Encouragingly, Spectral MLE allows perfect top-K item identification under minimal sample complexity. The practical applicability of Spectral MLE is further corroborated by numerical experiments.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/14/2016

Top-K Ranking from Pairwise Comparisons: When Spectral Ranking is Optimal

We explore the top-K rank aggregation problem. Suppose a collection of i...
research
07/31/2017

Spectral Method and Regularized MLE Are Both Optimal for Top-K Ranking

This paper is concerned with the problem of top-K ranking from pairwise ...
research
05/04/2021

On the Sample Complexity of Rank Regression from Pairwise Comparisons

We consider a rank regression setting, in which a dataset of N samples w...
research
07/22/2020

Assessing top-k preferences

Assessors make preference judgments faster and more consistently than gr...
research
07/02/2020

Spectral Methods for Ranking with Scarce Data

Given a number of pairwise preferences of items, a common task is to ran...
research
09/07/2023

Improved theoretical guarantee for rank aggregation via spectral method

Given pairwise comparisons between multiple items, how to rank them so t...
research
04/24/2017

Learning from Comparisons and Choices

When tracking user-specific online activities, each user's preference is...

Please sign up or login with your details

Forgot password? Click here to reset