no code implementations • 25 Sep 2022 • Arpit Agarwal, Rohan Ghuge, Viswanath Nagarajan
}$ We answer this in the affirmative $\textit{under the Condorcet condition}$, a standard setting of the $K$-armed dueling bandit problem.
no code implementations • 17 Aug 2022 • Yubing Cui, Viswanath Nagarajan
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.
no code implementations • 22 Feb 2022 • Arpit Agarwal, Rohan Ghuge, Viswanath Nagarajan
The $K$-armed dueling bandit problem, where the feedback is in the form of noisy pairwise comparisons, has been widely studied.
1 code implementation • NeurIPS 2019 • Su Jia, Viswanath Nagarajan, Fatemeh Navidi, R. Ravi
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.
no code implementations • 5 Jun 2016 • Fatemeh Navidi, Prabhanjan Kambadur, Viswanath Nagarajan
We obtain a logarithmic factor approximation algorithm for this adaptive ranking problem, which is the best possible (unless P=NP).