Learning Mixed Membership Mallows Models from Pairwise Comparisons

04/03/2015
by   Weicong Ding, et al.
0

We propose a novel parameterized family of Mixed Membership Mallows Models (M4) to account for variability in pairwise comparisons generated by a heterogeneous population of noisy and inconsistent users. M4 models individual preferences as a user-specific probabilistic mixture of shared latent Mallows components. Our key algorithmic insight for estimation is to establish a statistical connection between M4 and topic models by viewing pairwise comparisons as words, and users as documents. This key insight leads us to explore Mallows components with a separable structure and leverage recent advances in separable topic discovery. While separability appears to be overly restrictive, we nevertheless show that it is an inevitable outcome of a relatively small number of latent Mallows components in a world of large number of items. We then develop an algorithm based on robust extreme-point identification of convex polygons to learn the reference rankings, and is provably consistent with polynomial sample complexity guarantees. We demonstrate that our new model is empirically competitive with the current state-of-the-art approaches in predicting real-world preferences.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/11/2014

A Topic Modeling Approach to Ranking

We propose a topic modeling approach to the prediction of preferences in...
research
08/23/2015

Necessary and Sufficient Conditions and a Provably Efficient Algorithm for Separable Topic Discovery

We develop necessary and sufficient conditions and a novel provably cons...
research
02/16/2015

Clustering and Inference From Pairwise Comparisons

Given a set of pairwise comparisons, the classical ranking problem compu...
research
07/02/2020

Spectral Methods for Ranking with Scarce Data

Given a number of pairwise preferences of items, a common task is to ran...
research
01/05/2013

A New Geometric Approach to Latent Topic Modeling and Discovery

A new geometrically-motivated algorithm for nonnegative matrix factoriza...
research
10/03/2014

Individualized Rank Aggregation using Nuclear Norm Regularization

In recent years rank aggregation has received significant attention from...
research
12/03/2019

Rank Aggregation via Heterogeneous Thurstone Preference Models

We propose the Heterogeneous Thurstone Model (HTM) for aggregating ranke...

Please sign up or login with your details

Forgot password? Click here to reset