7 citations · 7 across the 1 of their papers we have counts for
3 papers
Adversarial Online Learning with Changing Action Sets: Efficient Algorithms with Approximate Regret Bounds
Ehsan Emamjomeh-Zadeh, Chen-Yu Wei, Haipeng Luo +1
We revisit the problem of online learning with sleeping experts/bandits: in each time step, only a subset of the actions are available for the algorithm to choose from (and learn a…
The Complexity of Interactively Learning a Stable Matching by Trial and Error
Ehsan Emamjomeh-Zadeh, Yannai A. Gonczarowski, David Kempe
In a stable matching setting, we consider a query model that allows for an interactive learning algorithm to make precisely one type of query: proposing a matching, the response to…
A General Framework for Robust Interactive Learning
Ehsan Emamjomeh-Zadeh, David Kempe
We propose a general framework for interactively learning models, such as (binary or non-binary) classifiers, orderings/rankings of items, or clusterings of data points. Our framew…