[HTML][HTML] Spectral method and regularized MLE are both optimal for top-K ranking

Y Chen, J Fan, C Ma, K Wang - Annals of statistics, 2019 - ncbi.nlm.nih.gov
This paper is concerned with the problem of top-K ranking from pairwise comparisons. Given
a collection of n items and a few pairwise comparisons across them, one wishes to identify …

Spectral mle: Top-k rank aggregation from pairwise comparisons

Y Chen, C Suh - International Conference on Machine …, 2015 - proceedings.mlr.press
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 …

Preference-based online learning with dueling bandits: A survey

V Bengs, R Busa-Fekete, A El Mesaoudi-Paul… - Journal of Machine …, 2021 - jmlr.org
In machine learning, the notion of multi-armed bandits refers to a class of online learning
problems, in which an agent is supposed to simultaneously explore and exploit a given set …

Fast and accurate inference of Plackett–Luce models

L Maystre, M Grossglauser - Advances in neural information …, 2015 - proceedings.neurips.cc
We show that the maximum-likelihood (ML) estimate of models derived from Luce's choice
axiom (eg, the Plackett-Luce model) can be expressed as the stationary distribution of a …

Minimax-optimal inference from partial rankings

B Hajek, S Oh, J Xu - Advances in Neural Information …, 2014 - proceedings.neurips.cc
This paper studies the problem of rank aggregation under the Plackett-Luce model. The goal
is to infer a global ranking and related scores of the items, based on partial rankings …

Online rank elicitation for plackett-luce: A dueling bandits approach

B Szörényi, R Busa-Fekete, A Paul… - Advances in neural …, 2015 - proceedings.neurips.cc
We study the problem of online rank elicitation, assuming that rankings of a set of
alternatives obey the Plackett-Luce distribution. Following the setting of the dueling bandits …

Lagrangian inference for ranking problems

Y Liu, EX Fang, J Lu - Operations research, 2023 - pubsonline.informs.org
We propose a novel combinatorial inference framework to conduct general uncertainty
quantification in ranking problems. We consider the widely adopted Bradley-Terry-Luce …

Accelerated spectral ranking

A Agarwal, P Patil, S Agarwal - International Conference on …, 2018 - proceedings.mlr.press
The problem of rank aggregation from pairwise and multiway comparisons has a wide range
of implications, ranging from recommendation systems to sports rankings to social choice …

Sync-rank: Robust ranking, constrained ranking and rank aggregation via eigenvector and SDP synchronization

M Cucuringu - IEEE Transactions on Network Science and …, 2016 - ieeexplore.ieee.org
We consider the classical problem of establishing a statistical ranking of a set of n items
given a set of inconsistent and incomplete pairwise comparisons between such items …

Group decision making under uncertain preferences: powered by AI, empowered by AI

L Xia - Annals of the New York Academy of Sciences, 2022 - Wiley Online Library
Group decision making is an important, long‐standing, and ubiquitous problem in all
societies, where collective decisions must be made by a group of agents despite individual …