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

We consider PAC-learning a good item from k-subsetwise feedback information sampled from a Plackett-Luce probability model, with instance-dependent sample complexity performance. In the setting where subsets of a fixed size can be tested and top-ranked feedback is made available to the learner, we give an algorithm with optimal instance-dependent sample complexity, for PAC best arm identification, of Obigg(fracθ[k]ksumi = 2nmaxBig(1,frac1Deltai2Big) lnfrackδBig(ln frac1DeltaiBig)bigg), Deltai being the Plackett-Luce parameter gap between the best and the ith best item, and θ[k] is the sum of the pl, parameters for the top-k items. The algorithm is based on a wrapper around a PAC winner-finding algorithm with weaker performance guarantees to adapt to the hardness of the input instance. The sample complexity is also shown to be multiplicatively better depending on the length of rank-ordered feedback available in each subset-wise play. We show optimality of our algorithms with matching sample complexity lower bounds. We next address the winner-finding problem in Plackett-Luce models in the fixed-budget setting with instance dependent upper and lower bounds on the misidentification probability, of Omegaleft(exp(-2 tilde Delta Q) right) for a given budget Q, where tilde Delta is an explicit instance-dependent problem complexity parameter. Numerical performance results are also reported.