5 papers
Batched Stochastic Linear Bandits with 1-Bit Communication Constraints
Ivan Lau, Daniel McMorrow, Kevin Jamieson +1
We study stochastic linear bandits under a natural combination of batching and communication constraints: the time horizon is partitioned into batches of equal size , and during…
Robust Instance Optimal Phase-Only Compressed Sensing
Junren Chen, Michael K. Ng, Jonathan Scarlett
Phase-only compressed sensing (PO-CS) concerns the recovery of sparse signals from the phases of complex measurements. Recent results show that sparse signals in the standard spher…
A General Framework for Clustering and Distribution Matching with Bandit Feedback
Recep Can Yavas, Yuqi Huang, Vincent Y. F. Tan +1
We develop a general framework for clustering and distribution matching problems with bandit feedback. We consider a -armed bandit model where some subset of arms is partiti…
Approximate Message Passing with Rigorous Guarantees for Pooled Data and Quantitative Group Testing
Nelvin Tan, Pablo Pascual Cobo, Jonathan Scarlett +1
In the pooled data problem, the goal is to identify the categories associated with a large collection of items via a sequence of pooled tests. Each pooled test reveals the number o…
Exact Thresholds for Noisy Non-Adaptive Group Testing
Junren Chen, Jonathan Scarlett
In recent years, the mathematical limits and algorithmic bounds for probabilistic group testing have become increasingly well-understood, with exact asymptotic thresholds now being…