Individualized Rank Aggregation using Nuclear Norm Regularization

10/03/2014
by   Yu Lu, et al.
0

In recent years rank aggregation has received significant attention from the machine learning community. The goal of such a problem is to combine the (partially revealed) preferences over objects of a large population into a single, relatively consistent ordering of those objects. However, in many cases, we might not want a single ranking and instead opt for individual rankings. We study a version of the problem known as collaborative ranking. In this problem we assume that individual users provide us with pairwise preferences (for example purchasing one item over another). From those preferences we wish to obtain rankings on items that the users have not had an opportunity to explore. The results here have a very interesting connection to the standard matrix completion problem. We provide a theoretical justification for a nuclear norm regularized optimization procedure, and provide high-dimensional scaling results that show how the error in estimating user preferences behaves as the number of observations increase.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/14/2016

Preference Completion from Partial Rankings

We propose a novel and efficient algorithm for the collaborative prefere...
research
10/19/2019

Online Ranking with Concept Drifts in Streaming Data

Two important problems in preference elicitation are rank aggregation an...
research
06/26/2015

Collaboratively Learning Preferences from Ordinal Data

In applications such as recommendation systems and revenue management, i...
research
11/04/2018

IteRank: An iterative network-oriented approach to neighbor-based collaborative ranking

Neighbor-based collaborative ranking (NCR) techniques follow three conse...
research
12/14/2018

DATELINE: Deep Plackett-Luce Model with Uncertainty Measurements

The aggregation of k-ary preferences is a historical and important probl...
research
10/09/2018

A universal university ranking from the revealed preferences of the applicants

A methodology is presented to rank universities on the basis of the appl...
research
04/03/2015

Learning Mixed Membership Mallows Models from Pairwise Comparisons

We propose a novel parameterized family of Mixed Membership Mallows Mode...

Please sign up or login with your details

Forgot password? Click here to reset