Search Results for author:
Found 5 papers, 1 papers with code
An Asymptotically Optimal Batched Algorithm for the Dueling Bandit Problem
}$ We answer this in the affirmative $\textit{under the Condorcet condition}$, a standard setting of the $K$-armed dueling bandit problem.
Minimum Cost Adaptive Submodular Cover
We consider the problem of minimum cost cover of adaptive-submodular functions, and provide a 4(ln Q+1)-approximation algorithm, where Q is the goal value.
Batched Dueling Bandits
The $K$-armed dueling bandit problem, where the feedback is in the form of noisy pairwise comparisons, has been widely studied.
Optimal Decision Tree with Noisy Outcomes
Our new approximation algorithms provide guarantees that are nearly best-possible and work for the general case of a large number of noisy outcomes per test or per hypothesis where the performance degrades smoothly with this number.
Adaptive Submodular Ranking and Routing
We obtain a logarithmic factor approximation algorithm for this adaptive ranking problem, which is the best possible (unless P=NP).
