• Corpus ID: 238531458

Uncertainty quantification in the Bradley-Terry-Luce model

  title={Uncertainty quantification in the Bradley-Terry-Luce model},
  author={Chao Gao and Yandi Shen and Anderson Y. Zhang},
  • Chao Gao, Yandi Shen, Anderson Y. Zhang
  • Published 8 October 2021
  • Mathematics
The Bradley-Terry-Luce (BTL) model is a benchmark model for pairwise comparisons between individuals. Despite recent progress on the first-order asymptotics of several popular procedures, the understanding of uncertainty quantification in the BTL model remains largely incomplete, especially when the underlying comparison graph is sparse. In this paper, we fill this gap by focusing on two estimators that have received much recent attention: the maximum likelihood estimator (MLE) and the spectral… 


Asymptotics when the number of parameters tends to infinity in the Bradley-Terry model for paired comparisons
We are concerned here with establishing the consistency and asymptotic normality for the maximum likelihood estimator of a merit vector (u 0 , ..., u t ), representing the merits of t+1 teams
MM algorithms for generalized Bradley-Terry models
The Bradley-Terry model for paired comparisons is a simple and muchstudied means to describe the probabilities of the possible outcomes when individuals are judged against one another in pairs. Among
Spectral Method and Regularized MLE Are Both Optimal for Top-$K$ Ranking
It is demonstrated that under a natural random sampling model, the spectral method alone, or the regularized MLE alone, is minimax optimal in terms of the sample complexity - the number of paired comparisons needed to ensure exact top-K identification, for the fixed dynamic range regime.
Spectral MLE: Top-K Rank Aggregation from Pairwise Comparisons
This paper describes the minimax limits on identifiability of top-$K$ ranked items, in the presence of random and non-adaptive sampling, and proposes a nearly linear-time ranking scheme, called Spectral MLE, that allows perfect top-K$ item identification under minimal sample complexity.
User-Friendly Tail Bounds for Sums of Random Matrices
  • J. Tropp
  • Mathematics, Computer Science
    Found. Comput. Math.
  • 2012
This paper presents new probability inequalities for sums of independent, random, self-adjoint matrices and provides noncommutative generalizations of the classical bounds associated with the names Azuma, Bennett, Bernstein, Chernoff, Hoeffding, and McDiarmid.
Random graphs with a given degree sequence
Large graphs are sometimes studied through their degree sequences (power law or regular graphs). We study graphs that are uniformly chosen with a given degree sequence. Under mild conditions, it is
Applications of the van Trees inequality : a Bayesian Cramr-Rao bound
We use a Bayesian version of the Cramer-Rao lower bound due to van Trees to give an elementary proof that the limiting distibution of any regular estimator cannot have a variance less than the
Recent developments in exponential random graph (p*) models for social networks
The inclusion of a new higher order transitivity statistic allows estimation of parameters of exponential graph models for many (but not all) cases where it is impossible to estimate parameters of homogeneous Markov graph models.
Rank Centrality: Ranking from Pairwise Comparisons
Experimental evaluations on synthetic data sets generated according to the popular Bradley-Terry-Luce (BTL) model show that the proposed Rank Centrality algorithm performs as well as the maximum likelihood estimator for that model and outperforms other popular ranking algorithms.
An Introduction to Matrix Concentration Inequalities
  • J. Tropp
  • Computer Science, Mathematics
    Found. Trends Mach. Learn.
  • 2015
The aim of this monograph is to describe the most successful methods from this area along with some interesting examples that these techniques can illuminate.