Preference Modeling with Context-Dependent Salient Features

02/22/2020
by   Amanda Bower, et al.
0

We consider the problem of estimating a ranking on a set of items from noisy pairwise comparisons given item features. We address the fact that pairwise comparison data often reflects irrational choice, e.g. intransitivity. Our key observation is that two items compared in isolation from other items may be compared based on only a salient subset of features. Formalizing this framework, we propose the "salient feature preference model" and prove a sample complexity result for learning the parameters of our model and the underlying ranking with maximum likelihood estimation. We also provide empirical results that support our theoretical bounds and illustrate how our model explains systematic intransitivity. Finally we demonstrate strong performance of maximum likelihood estimation of our model on both synthetic data and two real data sets: the UT Zappos50K data set and comparison data about the compactness of legislative districts in the US.

READ FULL TEXT
research
03/14/2016

Top-K Ranking from Pairwise Comparisons: When Spectral Ranking is Optimal

We explore the top-K rank aggregation problem. Suppose a collection of i...
research
11/22/2022

Ranking Inferences Based on the Top Choice of Multiway Comparisons

This paper considers ranking inference of n items based on the observed ...
research
02/16/2015

Clustering and Inference From Pairwise Comparisons

Given a set of pairwise comparisons, the classical ranking problem compu...
research
04/13/2023

Ranking from Pairwise Comparisons in General Graphs and Graphs with Locality

This technical report studies the problem of ranking from pairwise compa...
research
06/23/2022

Efficient and Accurate Top-K Recovery from Choice Data

The intersection of learning to rank and choice modeling is an active ar...
research
02/24/2017

Rank-to-engage: New Listwise Approaches to Maximize Engagement

For many internet businesses, presenting a given list of items in an ord...
research
04/07/2012

The asymptotics of ranking algorithms

We consider the predictive problem of supervised ranking, where the task...

Please sign up or login with your details

Forgot password? Click here to reset