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

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

Aadirupa Saha
Aditya Gopalan
ArXivPDFHTML

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
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
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
On the Complexity of Best Arm Identification in Multi-Armed Bandit Models
E. Kaufmann
Olivier Cappé
Aurélien Garivier
174
1,025
0
16 Jul 2014