MLLGJan 13, 2025

Pairwise Comparisons without Stochastic Transitivity: Model, Theory and Applications

arXiv:2501.07437v13 citationsh-index: 3
Originality Highly original
AI Analysis

This addresses the limitation of existing pairwise comparison models for applications where stochastic transitivity does not hold, such as in competitive games or multi-skill assessments, offering a more flexible and accurate alternative.

The paper tackles the problem of modeling pairwise comparisons without assuming stochastic transitivity, which often fails in real-world scenarios like games with multiple skills, and proposes a new model based on low-dimensional skew-symmetric matrices that achieves minimax-rate optimality and outperforms the Bradley-Terry model in simulations and real data.

Most statistical models for pairwise comparisons, including the Bradley-Terry (BT) and Thurstone models and many extensions, make a relatively strong assumption of stochastic transitivity. This assumption imposes the existence of an unobserved global ranking among all the players/teams/items and monotone constraints on the comparison probabilities implied by the global ranking. However, the stochastic transitivity assumption does not hold in many real-world scenarios of pairwise comparisons, especially games involving multiple skills or strategies. As a result, models relying on this assumption can have suboptimal predictive performance. In this paper, we propose a general family of statistical models for pairwise comparison data without a stochastic transitivity assumption, substantially extending the BT and Thurstone models. In this model, the pairwise probabilities are determined by a (approximately) low-dimensional skew-symmetric matrix. Likelihood-based estimation methods and computational algorithms are developed, which allow for sparse data with only a small proportion of observed pairs. Theoretical analysis shows that the proposed estimator achieves minimax-rate optimality, which adapts effectively to the sparsity level of the data. The spectral theory for skew-symmetric matrices plays a crucial role in the implementation and theoretical analysis. The proposed method's superiority against the BT model, along with its broad applicability across diverse scenarios, is further supported by simulations and real data analysis.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes