Lecture Notes in Computer Science, Volume 12322 (SUM 2020: Scalable Uncertainty Management) (SUM 2020), pp. 98 – 112, Sept 2020.
Learning ranking models is a difficult task, in which data may be scarce and cautious predictions desirable. To address such issues, we explore the extension of the popular parametric probabilistic Plackett–Luce model, often used to model rankings, to the imprecise setting where estimated parameters are set-valued. In particular, we study how to achieve cautious or conservative inference with it, and illustrate their application on label ranking problems, a specific supervised learning task.