mlsanityData to 14 Oct 2026

Uncertainty Quantification of MLE for Entity Ranking with Covariates

arXiv 2212.09961 ↗First posted 20 Dec 2022stat.ME cs.LG math.STcited by 16

Not on the map. Why?

Abstract (arXiv)

This paper concerns with statistical estimation and inference for the ranking problems based on pairwise comparisons with additional covariate information such as the attributes of the compared items. Despite extensive studies, few prior literatures investigate this problem under the more realistic setting where covariate information exists. To tackle this issue, we propose a novel model, Covariate-Assisted Ranking Estimation (CARE) model, that extends the well-known Bradley-Terry-Luce (BTL) model, by incorporating the covariate information. Specifically, instead of assuming every compared item has a fixed latent score θi^*i=1n, we assume the underlying scores are given by αi^*+xi^topβ^*i=1n, where αi^* and xi^topβ^* represent latent baseline and covariate score of the i-th item, respectively. We impose natural identifiability conditions and derive the ℓ∞- and ℓ2-optimal rates for the maximum likelihood estimator of αi^*i=1n and β^* under a sparse comparison graph, using a novel `leave-one-out' technique (Chen et al., 2019) . To conduct statistical inferences, we further derive asymptotic distributions for the MLE of αi^*i=1n and β^* with minimal sample complexity. This allows us to answer the question whether some covariates have any explanation power for latent scores and to threshold some sparse parameters to improve the ranking performance. We improve the approximation method used in (Gao et al., 2021) for the BLT model and generalize it to the CARE model. Moreover, we validate our theoretical results through large-scale numerical studies and an application to the mutual fund stock holding dataset.

Key facts. Cited by 16 papers in the map (data through 14 Oct 2026). Builds on 16 of its 46 references that are in the map. First posted on arXiv 20 Dec 2022.

Builds on

16 of 46 references.

References · 16

  1. 2015An Introduction to Matrix Concentration Inequalitiescited by 397
  2. 2020Spectral Methods for Data Science: A Statistical Perspectivecited by 112
  3. 2015Simple, Robust and Optimal Ranking from Pairwise Comparisonscited by 70
  4. 2019Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimizationcited by 58
  5. 2017Spectral Method and Regularized MLE Are Both Optimal for Top-K Rankingcited by 47
  6. 2015Spectral MLE: Top-K Rank Aggregation from Pairwise Comparisonscited by 34
  7. 2015Stochastically Transitive Models for Pairwise Comparisons: Statistical and Computational Issuescited by 32
  8. 2021Uncertainty quantification in the Bradley-Terry-Luce modelcited by 29
  9. 2014Minimax-optimal Inference from Partial Rankingscited by 24
  10. 2022Ranking Inferences Based on the Top Choice of Multiway Comparisonscited by 22
  11. 2021Lagrangian Inference for Ranking Problemscited by 19
  12. 2021Optimal Full Ranking from Pairwise Comparisonscited by 16
4 more
  1. 2019Rank Aggregation via Heterogeneous Thurstone Preference Modelscited by 12
  2. 2016Top-K Ranking from Pairwise Comparisons: When Spectral Ranking is Optimalcited by 10
  3. 2016Competitive analysis of the top-K ranking problemcited by 6
  4. 2017Worst-case vs Average-case Design for Estimation from Fixed Pairwise Comparisonscited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 2; 2024: 5; 2025: 3; 2026: 6.

16 papers.

Sort:

By area: