Search Results for author: Viswanath Nagarajan

Found 5 papers, 1 papers with code

An Asymptotically Optimal Batched Algorithm for the Dueling Bandit Problem

no code implementations25 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.

Recommendation Systems

Minimum Cost Adaptive Submodular Cover

no code implementations17 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.

Batched Dueling Bandits

no code implementations22 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.

Recommendation Systems

Optimal Decision Tree with Noisy Outcomes

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.

Active Learning

Adaptive Submodular Ranking and Routing

no code implementations5 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).

Active Learning

Cannot find the paper you are looking for? You can Submit a new open access paper.