The Adaptive Complexity of Maximizing a Gross Substitutes Valuation

no code implementations • NeurIPS 2020 • Ron Kupfer, Sharon Qian, Eric Balkanski, Yaron Singer

Both the upper and lower bounds are under the assumption that queries are only on feasible sets (i. e., of size at most k).

An Optimal Elimination Algorithm for Learning a Best Arm

no code implementations • NeurIPS 2020 • Avinatan Hassidim, Ron Kupfer, Yaron Singer

We consider the classic problem of $(\epsilon,\delta)$-PAC learning a best arm where the goal is to identify with confidence $1-\delta$ an arm whose mean is an $\epsilon$-approximation to that of the highest mean arm in a multi-armed bandit setting.

Learning Theory PAC learning