433 citations · 1.1k across the 23 of their papers we have counts for
23 papers
Fast Rates for Offline Contextual Bandits with Forward-KL Regularization under Single-Policy Concentrability
Qingyue Zhao, Kaixuan Ji, Heyang Zhao +1
\emph{Kullback-Leibler} (KL) regularization is ubiquitous in reinforcement learning algorithms in the form of \emph{reverse} or \emph{forward} KL. Recent studies have demonstrated…
Optimal Nested Test Plan for Combinatorial Quantitative Group Testing
Chao Wang, Qing Zhao, Chen-Nee Chuah
We consider the quantitative group testing problem where the objective is to identify defective items in a given population based on results of tests performed on subsets of the po…
Minimum Information Dominating Set for Opinion Sampling
Jianhang Gao, Qing Zhao, Anathram Swami
We consider the problem of inferring the opinions of a social network through strategically sampling a minimum subset of nodes by exploiting correlations in node opinions. We first…
Asymptotically Optimal Anomaly Detection via Sequential Testing
Kobi Cohen, Qing Zhao
Sequential detection of independent anomalous processes among K processes is considered. At each time, only M processes can be observed, and the observations from each chosen proce…
Optimal Index Policies for Anomaly Localization in Resource-Constrained Cyber Systems
Kobi Cohen, Qing Zhao, Ananthram Swami
The problem of anomaly localization in a resource-constrained cyber system is considered. Each anomalous component of the system incurs a cost per unit time until its anomaly is id…
The Thinnest Path Problem
Jianhang Gao, Qing Zhao, Ananthram Swami
We formulate and study the thinnest path problem in wireless ad hoc networks. The objective is to find a path from a source to its destination that results in the minimum number of…