117 citations · 273 across the 35 of their papers we have counts for
42 papers
Optimal Decision Tree and Adaptive Submodular Ranking with Noisy Outcomes
Su Jia, Fatemeh Navidi, Viswanath Nagarajan +1
In pool-based active learning, the learner is given an unlabeled data set and aims to efficiently learn the unknown hypothesis by querying the labels of the data points. This can b…
An Asymptotically Optimal Batched Algorithm for the Dueling Bandit Problem
Arpit Agarwal, Rohan Ghuge, Viswanath Nagarajan
We study the -armed dueling bandit problem, a variation of the traditional multi-armed bandit problem in which feedback is obtained in the form of pairwise comparisons. Previous…
Minimum Cost Adaptive Submodular Cover
Hessa Al-Thani, Yubing Cui, Viswanath Nagarajan
Adaptive submodularity is a fundamental concept in stochastic optimization, with numerous applications such as sensor placement, hypothesis identification and viral marketing. We c…
Batched Dueling Bandits
Arpit Agarwal, Rohan Ghuge, Viswanath Nagarajan
The -armed dueling bandit problem, where the feedback is in the form of noisy pairwise comparisons, has been widely studied. Previous works have only focused on the sequential s…
On Some Variants of Euclidean K-Supplier
Euiwoong Lee, Viswanath Nagarajan, Lily Wang
The -Supplier problem is an important location problem that has been actively studied in both general and Euclidean metrics. Many of its variants have also been studied, primari…
Non-Adaptive Stochastic Score Classification and Explainable Halfspace Evaluation
Rohan Ghuge, Anupam Gupta, Viswanath Nagarajan
Sequential testing problems involve a complex system with several components, each of which is "working" with some independent probability. The outcome of each component can be det…