Learning Rich Rankings
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
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,375
- 2014DeepWalk: Online Learning of Social Representationscited by 1,547
- 2017Implicit Regularization in Matrix Factorizationcited by 322
- 2017No Spurious Local Minima in Nonconvex Low Rank Problems: A Unified Geometric Analysiscited by 129
- 2017Deep linear neural networks with arbitrary loss: All local minima are globalcited by 65
- 2015Estimation from Pairwise Comparisons: Sharp Minimax Bounds with Topology Dependencecited by 61
- 2014Minimax-optimal Inference from Partial Rankingscited by 24
- 2016Learning Mixtures of Plackett-Luce Modelscited by 19
- 2019Discovering Context Effects from Raw Choice Datacited by 14
- 2016Exponential Family Embeddingscited by 13
- 2017Learning from Comparisons and Choicescited by 12
2 more
- 2016Pairwise Choice Markov Chainscited by 10
- 2014Learning Mixed Multinomial Logit Model from Ordinal Datacited by 7
Built on by
Citing papers per year: 2024: 2; 2025: 3; 2026: 3.
8 papers.
- 2024Inferring Dynamic Networks from Marginals with Iterative Proportional Fittingcited by 3
- 2025Leveraging Sparsity for Sample-Efficient Preference Learning: A Theoretical Perspectivecited by 3
- 2024When the Universe is Too Big: Bounding Consideration Probabilities for Plackett-Luce Rankingscited by 1
- 2025Hypothesis Testing for Generalized Thurstone Modelscited by 1
- 2026DeepHalo: A Neural Choice Model with Controllable Context Effectscited by 1
- 2025Generalized Top-k Mallows Model for Ranked Choicescited by 0
- 2026A Differentiable Bayesian Relaxation for Latent Partial-Order Inferencecited by 0
- 2026MoPLEx: Estimating Plackett-Luce Mixture Models for Multi-Objective Alignmentcited by 0
- 2026MoPLEx: Estimating Plackett-Luce Mixture Models for Multi-Objective Alignment25 Aug 2026
- 2026A Differentiable Bayesian Relaxation for Latent Partial-Order Inference7 May 2026
- 2026DeepHalo: A Neural Choice Model with Controllable Context Effects8 Jan 2026
- 2025Hypothesis Testing for Generalized Thurstone Models2 Dec 2025
- 2025Generalized Top-k Mallows Model for Ranked Choices24 Oct 2025
- 2025Leveraging Sparsity for Sample-Efficient Preference Learning: A Theoretical Perspective30 Jan 2025
- 2024Inferring Dynamic Networks from Marginals with Iterative Proportional Fitting28 Feb 2024
- 2024When the Universe is Too Big: Bounding Consideration Probabilities for Plackett-Luce Rankings19 Jan 2024