Abstract
In many supervised learning settings, elicited labels comprise pairwise comparisons or rankings of samples. We propose a Bayesian inference model for ranking datasets, allowing us to take a probabilistic approach to ranking inference. Our probabilistic assumptions are motivated by, and consistent with, the so-called Plackett-Luce model. We propose a variational inference method to extract a closed-form Gaussian posterior distribution. We show experimentally that the resulting posterior yields more reliable ranking predictions compared to predictions via point estimates.
Original language | English (US) |
---|---|
Pages (from-to) | 599-614 |
Number of pages | 16 |
Journal | Proceedings of Machine Learning Research |
Volume | 101 |
State | Published - 2019 |
Event | 11th Asian Conference on Machine Learning, ACML 2019 - Nagoya, Japan Duration: Nov 17 2019 → Nov 19 2019 |
Keywords
- Plackett Luce
- Softmax Bound
- Variational inference
ASJC Scopus subject areas
- Artificial Intelligence
- Software
- Control and Systems Engineering
- Statistics and Probability