activity
20182026
most citedBatched Dueling Bandits

1 citations · 3 across the 9 of their papers we have counts for

collaborators
Showing cs.DSShow all

6 papers · 1 filter

cs.DS2026

Stochastic Function Certification with Correlations

Rohan Ghuge, Jai Moondra, Mohit Singh

We study the Stochastic Boolean Function Certification (SBFC) problem, where we are given Bernoulli random variables on a ground set of elements with…

cs.DS2025

Single-Sample and Robust Online Resource Allocation

Rohan Ghuge, Sahil Singla, Yifan Wang

Online Resource Allocation problem is a central problem in many areas of Computer Science, Operations Research, and Economics. In this problem, we sequentially receive stochast…

cs.DS2023

Informative Path Planning with Limited Adaptivity

Rayen Tan, Rohan Ghuge, Viswanath Nagarajan

We consider the informative path planning () problem in which a robot interacts with an uncertain environment and gathers information by visiting locations. The goal…

cs.DS2021★ 1 cited

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…

cs.DS2021

The Power of Adaptivity for Stochastic Submodular Cover

Rohan Ghuge, Anupam Gupta, Viswanath Nagarajan

In the stochastic submodular cover problem, the goal is to select a subset of stochastic items of minimum expected cost to cover a submodular function. Solutions in this setting co…

cs.DS2018

Quasi-Polynomial Algorithms for Submodular Tree Orienteering and Other Directed Network Design Problems

Rohan Ghuge, Viswanath Nagarajan

We consider the following general network design problem on directed graphs. The input is an asymmetric metric , root , monotone submodular function $f:2^V\right…