5 papers
Lookahead identification in adversarial bandits: accuracy and memory bounds
Nataly Brukhim, Nicolò Cesa-Bianchi, Carlo Ciliberto
We study an identification problem in multi-armed bandits. In each round a learner selects one of arms and observes its reward, with the goal of eventually identifying an arm t…
Learning Conditional Averages
Marco Bressan, Nataly Brukhim, Nicolo Cesa-Bianchi +4
We introduce the problem of learning conditional averages in the PAC framework. The learner receives a sample labeled by an unknown target concept from a known concept class, as in…
A note on the distinct distances problem over finite fields
Nataly Brukhim, Ariel Bruner, Orit E. Raz
We study a finite-field analogue of the ErdÅs distinct distances problem under the Hamming metric. For a set \(S\subseteq \mathbb{F}_q^n\) let denote the set of Hamming di…
On the Hardness of Bandit Learning
Nataly Brukhim, Aldo Pacchiano, Miroslav Dudik +1
We study the task of bandit learning, also known as best-arm identification, under the assumption that the true reward function f belongs to a known, but arbitrary, function class…
Of Dice and Games: A Theory of Generalized Boosting
Marco Bressan, Nataly Brukhim, Nicolò Cesa-Bianchi +4
Cost-sensitive loss functions are crucial in many real-world prediction problems, where different types of errors are penalized differently; for example, in medical diagnosis, a fa…