The Limits of Maxing, Ranking, and Preference LearningDownload PDFOpen Website

2018 (modified: 11 Nov 2022)ICML 2018Readers: Everyone
Abstract: We present a comprehensive understanding of three important problems in PAC preference learning: maximum selection (maxing), ranking, and estimating <em>all</em> pairwise preference probabilities, ...
0 Replies

Loading