AIConfPaper
ICML 2018oral41 citations

The Limits of Maxing, Ranking, and Preference Learning

Moein Falahatgar, Ayush Jain, Alon Orlitsky, Venkatadheeraj Pichapati, Vaishakh Ravindrakumar

Source ↗PDF ↗Scholar ↗

Abstract

We present a comprehensive understanding of three important problems in PAC preference learning: maximum selection (maxing), ranking, and estimating

BibTeX
@InProceedings{pmlr-v80-falahatgar18a,
  title = 	 {The Limits of Maxing, Ranking, and Preference Learning},
  author =       {Falahatgar, Moein and Jain, Ayush and Orlitsky, Alon and Pichapati, Venkatadheeraj and Ravindrakumar, Vaishakh},
  booktitle = 	 {Proceedings of the 35th International Conference on Machine Learning},
  pages = 	 {1427--1436},
  year = 	 {2018},
  editor = 	 {Dy, Jennifer and Krause, Andreas},
  volume = 	 {80},
  series = 	 {Proceedings of Machine Learning Research},
  month = 	 {10--15 Jul},
  publisher =    {PMLR},
  pdf = 	 {http://proceedings.mlr.press/v80/falahatgar18a/falahatgar18a.pdf},
  url = 	 {https://proceedings.mlr.press/v80/falahatgar18a.html},
  abstract = 	 {We present a comprehensive understanding of three important problems in PAC preference learning: maximum selection (maxing), ranking, and estimating
The Limits of Maxing, Ranking, and Preference Learning · ICML 2018