Fast Algorithm for Generalized Multinomial Models with Ranking Data

Jiaqi Gu, Guosheng Yin
Proceedings of the 36th International Conference on Machine Learning, PMLR 97:2445-2453, 2019.

Abstract

We develop a framework of generalized multinomial models, which includes both the popular Plackett–Luce model and Bradley–Terry model as special cases. From a theoretical perspective, we prove that the maximum likelihood estimator (MLE) under generalized multinomial models corresponds to the stationary distribution of an inhomogeneous Markov chain uniquely. Based on this property, we propose an iterative algorithm that is easy to implement and interpret, and is guaranteed to converge. Numerical experiments on synthetic data and real data demonstrate the advantages of our Markov chain based algorithm over existing ones. Our algorithm converges to the MLE with fewer iterations and at a faster convergence rate. The new algorithm is readily applicable to problems such as page ranking or sports ranking data.

Cite this Paper

BibTeX
@InProceedings{pmlr-v97-gu19a, title = {Fast Algorithm for Generalized Multinomial Models with Ranking Data}, author = {Gu, Jiaqi and Yin, Guosheng}, booktitle = {Proceedings of the 36th International Conference on Machine Learning}, pages = {2445--2453}, year = {2019}, editor = {Chaudhuri, Kamalika and Salakhutdinov, Ruslan}, volume = {97}, series = {Proceedings of Machine Learning Research}, month = {09--15 Jun}, publisher = {PMLR}, pdf = {http://proceedings.mlr.press/v97/gu19a/gu19a.pdf}, url = {https://proceedings.mlr.press/v97/gu19a.html}, abstract = {We develop a framework of generalized multinomial models, which includes both the popular Plackett–Luce model and Bradley–Terry model as special cases. From a theoretical perspective, we prove that the maximum likelihood estimator (MLE) under generalized multinomial models corresponds to the stationary distribution of an inhomogeneous Markov chain uniquely. Based on this property, we propose an iterative algorithm that is easy to implement and interpret, and is guaranteed to converge. Numerical experiments on synthetic data and real data demonstrate the advantages of our Markov chain based algorithm over existing ones. Our algorithm converges to the MLE with fewer iterations and at a faster convergence rate. The new algorithm is readily applicable to problems such as page ranking or sports ranking data.} }
Endnote
%0 Conference Paper %T Fast Algorithm for Generalized Multinomial Models with Ranking Data %A Jiaqi Gu %A Guosheng Yin %B Proceedings of the 36th International Conference on Machine Learning %C Proceedings of Machine Learning Research %D 2019 %E Kamalika Chaudhuri %E Ruslan Salakhutdinov %F pmlr-v97-gu19a %I PMLR %P 2445--2453 %U https://proceedings.mlr.press/v97/gu19a.html %V 97 %X We develop a framework of generalized multinomial models, which includes both the popular Plackett–Luce model and Bradley–Terry model as special cases. From a theoretical perspective, we prove that the maximum likelihood estimator (MLE) under generalized multinomial models corresponds to the stationary distribution of an inhomogeneous Markov chain uniquely. Based on this property, we propose an iterative algorithm that is easy to implement and interpret, and is guaranteed to converge. Numerical experiments on synthetic data and real data demonstrate the advantages of our Markov chain based algorithm over existing ones. Our algorithm converges to the MLE with fewer iterations and at a faster convergence rate. The new algorithm is readily applicable to problems such as page ranking or sports ranking data.
APA
Gu, J. & Yin, G.. (2019). Fast Algorithm for Generalized Multinomial Models with Ranking Data. Proceedings of the 36th International Conference on Machine Learning, in Proceedings of Machine Learning Research 97:2445-2453 Available from https://proceedings.mlr.press/v97/gu19a.html.

Related Material