Learning Rich Rankings
Arjun Seshadri, Stephen Ragain, Johan Ugander

TL;DR
This paper introduces a novel contextual repeated selection (CRS) model that enhances multimodal ranking representation, backed by theoretical guarantees and superior performance on real-world data.
Contribution
The paper proposes the CRS model, providing the first tight bounds on risk for MNL and PL models, and demonstrates its effectiveness over existing methods.
Findings
CRS model outperforms existing ranking methods on real data.
Provides the first tail risk bound for the Plackett-Luce model.
Offers theoretical guarantees for maximum likelihood estimation.
Abstract
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…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
Taxonomy
TopicsGame Theory and Voting Systems · Economic and Environmental Valuation · Consumer Market Behavior and Pricing
