163 citations · 169 across the 8 of their papers we have counts for
Showing 2015Show all
3 papers · 1 filter
stat.ML2015
The Max -Armed Bandit: PAC Lower Bounds and Efficient Algorithms
Yahel David, Nahum Shimkin
We consider the Max -Armed Bandit problem, where a learning agent is faced with several stochastic arms, each a source of i.i.d. rewards of unknown distribution. At each time st…
stat.ML2015★ 1 cited
The Max -Armed Bandit: A PAC Lower Bound and tighter Algorithms
Yahel David, Nahum Shimkin
We consider the Max -Armed Bandit problem, where a learning agent is faced with several sources (arms) of items (rewards), and interested in finding the best item overall. At ea…
cs.GT2015★ 1 cited
An Online Convex Optimization Approach to Blackwell's Approachability
Nahum Shimkin
The notion of approachability in repeated games with vector payoffs was introduced by Blackwell in the 1950s, along with geometric conditions for approachability and corresponding…