Computing Parametric Ranking Models via Rank-Breaking

DSpace/Manakin Repository

Computing Parametric Ranking Models via Rank-Breaking

Citable link to this page


Title: Computing Parametric Ranking Models via Rank-Breaking
Author: Soufiani, Hossein Azari; Parkes, David C.; Xia, Lirong

Note: Order does not necessarily reflect citation order of authors.

Citation: Soufiani, Hossein Azari, David Parkes, and Lirong Xia. 2014. Computing Parametric Ranking Models via Rank-Breaking. In Proceedings of the 31st International Conference on Machine Learning (ICML14), Beijing, China, June 22-24, 2014: 360–368.
Full Text & Related Files:
Abstract: Rank breaking is a methodology introduced by Azari Soufiani et al. (2013a) for applying a Generalized Method of Moments (GMM) algorithm to the estimation of parametric ranking models. Breaking takes full rankings and breaks, or splits them up, into counts for pairs of alternatives that occur in particular positions (e.g., first place and second place, second place and third place). GMMs are of interest because they can achieve significant speed-up relative to maximum likelihood approaches and comparable statistical efficiency. We characterize the breakings for which the estimator is consistent for random utility models (RUMs) including Plackett-Luce and Normal-RUM, develop a general sufficient condition for a full breaking to be the only consistent breaking, and provide a trichotomy theorem in regard to single-edge breakings. Experimental results are presented to show the computational efficiency along with statistical performance of the proposed method.
Published Version:
Other Sources:
Terms of Use: This article is made available under the terms and conditions applicable to Open Access Policy Articles, as set forth at
Citable link to this page:
Downloads of this work:

Show full Dublin Core record

This item appears in the following Collection(s)


Search DASH

Advanced Search