35 citations · 37 across the 3 of their papers we have counts for
2 papers
cs.LG2014★ 35 cited
Reducing Dueling Bandits to Cardinal Bandits
Nir Ailon, Thorsten Joachims, Zohar Karnin
We present algorithms for reducing the Dueling Bandits problem to the conventional (stochastic) Multi-Armed Bandits problem. The Dueling Bandits problem is an online model of learn…
cs.CC2012★ 2 cited
A note on: No need to choose: How to get both a PTAS and Sublinear Query Complexity
Nir Ailon, Zohar Karnin
We revisit various PTAS's (Polynomial Time Approximation Schemes) for minimization versions of dense problems, and show that they can be performed with sublinear query complexity.…