Lower Bounds on the Bayes Risk of the Bayesian BTL Model with Applications to Comparison Graphs
Mine Alsan, Ranjitha Prasad, Vincent Y. F. Tan

TL;DR
This paper establishes fundamental lower bounds on the accuracy of ranking estimators under the Bayesian BTL model, considering various graph structures and extensions like home-field advantage, with implications for comparison graph design.
Contribution
It derives novel information-theoretic and Bayesian Cramér-Rao lower bounds for the Bayesian BTL model, including extensions for home-field advantage, and analyzes their implications for comparison graph structures.
Findings
Lower bounds on Bayes risk are derived for the Bayesian BTL model.
Comparison of bounds with EM algorithm performance demonstrates their utility.
Graph structure significantly influences the lower bounds on ranking accuracy.
Abstract
We consider the problem of aggregating pairwise comparisons to obtain a consensus ranking order over a collection of objects. We use the popular Bradley-Terry-Luce (BTL) model which allows us to probabilistically describe pairwise comparisons between objects. In particular, we employ the Bayesian BTL model which allows for meaningful prior assumptions and to cope with situations where the number of objects is large and the number of comparisons between some objects is small or even zero. For the conventional Bayesian BTL model, we derive information-theoretic lower bounds on the Bayes risk of estimators for norm-based distortion functions. We compare the information-theoretic lower bound with the Bayesian Cram\'{e}r-Rao lower bound we derive for the case when the Bayes risk is the mean squared error. We illustrate the utility of the bounds through simulations by comparing them with the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
