From PAC to Instance-Optimal Sample Complexity in the Plackett-Luce Model

1 March 2019

Papers citing "From PAC to Instance-Optimal Sample Complexity in the Plackett-Luce Model"

3 / 3 papers shown

Title
A Nearly Instance Optimal Algorithm for Top-k Ranking under the Multinomial Logit Model Xi Chen Yuanzhi Li Jieming Mao 37 41 0 25 Jul 2017
Competitive analysis of the top-K ranking problem Xi Chen Sivakanth Gopi Jieming Mao Jon Schneider 41 34 0 12 May 2016
On the Complexity of Best Arm Identification in Multi-Armed Bandit Models E. Kaufmann Olivier Cappé Aurélien Garivier 168 1,025 0 16 Jul 2014