Learning Mixtures of Plackett-Luce Models from Structured Partial Orders

10/25/2019
by   Zhibing Zhao, et al.
0

Mixtures of ranking models have been widely used for heterogeneous preferences. However, learning a mixture model is highly nontrivial, especially when the dataset consists of partial orders. In such cases, the parameter of the model may not be even identifiable. In this paper, we focus on three popular structures of partial orders: ranked top-l_1, l_2-way, and choice data over a subset of alternatives. We prove that when the dataset consists of combinations of ranked top-l_1 and l_2-way (or choice data over up to l_2 alternatives), mixture of k Plackett-Luce models is not identifiable when l_1+l_2< 2k-1 (l_2 is set to 1 when there are no l_2-way orders). We also prove that under some combinations, including ranked top-3, ranked top-2 plus 2-way, and choice data over up to 4 alternatives, mixtures of two Plackett-Luce models are identifiable. Guided by our theoretical results, we propose efficient generalized method of moments (GMM) algorithms to learn mixtures of two Plackett-Luce models, which are proven consistent. Our experiments demonstrate the efficacy of our algorithms. Moreover, we show that when full rankings are available, learning from different marginal events (partial orders) provides tradeoffs between statistical efficiency and computational efficiency.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/06/2020

Learning Mixtures of Plackett-Luce Models with Features from Top-l Orders

Plackett-Luce model (PL) is one of the most popular models for preferenc...
research
01/31/2022

On the identifiability of mixtures of ranking models

Mixtures of ranking models are standard tools for ranking problems. Howe...
research
12/31/2021

Fast Learning of MNL Model from General Partial Rankings with Application to Network Formation Modeling

Multinomial Logit (MNL) is one of the most popular discrete choice model...
research
12/02/2011

Label Ranking with Abstention: Predicting Partial Orders by Thresholding Probability Distributions (Extended Abstract)

We consider an extension of the setting of label ranking, in which the l...
research
07/05/2023

Bayesian D- and I-optimal designs for choice experiments involving mixtures and process variables

Many food products involve mixtures of ingredients, where the mixtures c...
research
09/20/2022

Efficient and accurate inference for mixtures of Mallows models with Spearman distance

The Mallows model occupies a central role in parametric modelling of ran...
research
08/03/2021

Bayesian I-optimal designs for choice experiments with mixtures

Discrete choice experiments are frequently used to quantify consumer pre...

Please sign up or login with your details

Forgot password? Click here to reset