Efficient Bayesian Inference from Noisy Pairwise Comparisons

Till Aczel, Lucas Theis, Wattenhofer Roger
10/10/2025
cs.LGcs.CV

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

Evaluating generative models is challenging because standard metrics often fail to reflect human preferences. Human evaluations are more reliable but costly and noisy, as participants vary in expertise, attention, and diligence. Pairwise comparisons improve consistency, yet aggregating them into overall quality scores requires careful modeling. Bradley-Terry-based methods update item scores from comparisons, but existing approaches either ignore rater variability or lack convergence guarantees, limiting robustness and interpretability. We introduce BBQ, a Bayesian Bradley-Terry variant that explicitly models rater quality, downweighting or removing unreliable participants, and provides guaranteed monotonic likelihood convergence through an Expectation-Maximization algorithm. Empirical results show that BBQ achieves faster convergence, well-calibrated uncertainty estimates, and more robust, interpretable rankings compared to baseline Bradley-Terry models, even with noisy or crowdsourced raters. This framework enables more reliable and cost-effective human evaluation of generative models.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{aczel2025efficient,
  title  = {Efficient Bayesian Inference from Noisy Pairwise Comparisons},
  author = {Till Aczel and Lucas Theis and Wattenhofer Roger},
  year   = {2025},
  eprint = {2510.09333},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2510.09333v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2510.09333.svg)](https://codeofpaper.com/paper/2510.09333)

Discussion