mlsanityData to 14 Oct 2026

Learning Rich Rankings

arXiv 2312.15081 ↗First posted 22 Dec 2023cs.LG cs.IR stat.MLcited by 8

Not on the map. Why?

Abstract (arXiv)

Although the foundations of ranking are well established, the ranking literature has primarily been focused on simple, unimodal models, e.g. the Mallows and Plackett-Luce models, that define distributions centered around a single total ordering. Explicit mixture models have provided some tools for modelling multimodal ranking data, though learning such models from data is often difficult. In this work, we contribute a contextual repeated selection (CRS) model that leverages recent advances in choice modeling to bring a natural multimodality and richness to the rankings space. We provide rigorous theoretical guarantees for maximum likelihood estimation under the model through structure-dependent tail risk and expected risk bounds. As a by-product, we also furnish the first tight bounds on the expected risk of maximum likelihood estimators for the multinomial logit (MNL) choice model and the Plackett-Luce (PL) ranking model, as well as the first tail risk bound on the PL ranking model. The CRS model significantly outperforms existing methods for modeling real world ranking data in a variety of settings, from racing to rank choice voting.

Key facts. Cited by 8 papers in the map (data through 14 Oct 2026). Builds on 14 of its 55 references that are in the map. First posted on arXiv 22 Dec 2023.

Builds on

14 of 55 references.

References · 14

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,375
  3. 2014DeepWalk: Online Learning of Social Representationscited by 1,547
  4. 2017Implicit Regularization in Matrix Factorizationcited by 322
  5. 2017No Spurious Local Minima in Nonconvex Low Rank Problems: A Unified Geometric Analysiscited by 129
  6. 2017Deep linear neural networks with arbitrary loss: All local minima are globalcited by 65
  7. 2015Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology Dependencecited by 61
  8. 2014Minimax-optimal Inference from Partial Rankingscited by 24
  9. 2016Learning Mixtures of Plackett-Luce Modelscited by 19
  10. 2019Discovering Context Effects from Raw Choice Datacited by 14
  11. 2016Exponential Family Embeddingscited by 13
  12. 2017Learning from Comparisons and Choicescited by 12
2 more
  1. 2016Pairwise Choice Markov Chainscited by 10
  2. 2014Learning Mixed Multinomial Logit Model from Ordinal Datacited by 7

Built on by

Cited by year (2026 to 14 Oct)

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

8 papers.