1 citations · 2 across the 5 of their papers we have counts for
1 paper · 1 filter
Tyler Lekang, Andrew Lamperski
In this paper, we present simple algorithms for Dueling Bandits. We prove that the algorithms have regret bounds for time horizon T of order O(T^rho ) with 1/2 <= rho <= 3/4, which…