1 citations · 1 across the 7 of their papers we have counts for
7 papers
Non-Adaptive 1-Bit Mean Estimation: Minimax Rates and the Sample-Interval Tradeoff
Ivan Lau, Jonathan Scarlett
We study distributed one-dimensional mean estimation under a 1-bit communication constraint. Each agent observes one sample, drawn independently from an unknown distribution, and r…
Open Problem: Is Interaction Necessary for Order-Optimal 1-bit Mean Estimation?
Ivan Lau, Jonathan Scarlett
We ask whether interaction is necessary for order-optimal 1-bit mean estimation over nonparametric finite-moment classes. Adaptive threshold-query protocols achieve the order-optim…
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…
Order-Optimal Sequential 1-Bit Mean Estimation in General Tail Regimes
Ivan Lau, Jonathan Scarlett
In this paper, we study the problem of mean estimation under 1-bit communication constraints. We propose a novel adaptive mean estimator based solely on randomized threshold querie…
Sequential 1-bit Mean Estimation with Near-Optimal Sample Complexity
Ivan Lau, Jonathan Scarlett
In this paper, we study the problem of distributed mean estimation with 1-bit communication constraints. We propose a mean estimator that is based on (randomized and sequentially-c…
Quantile Multi-Armed Bandits with 1-bit Feedback
Ivan Lau, Jonathan Scarlett
In this paper, we study a variant of best-arm identification involving elements of risk sensitivity and communication constraints. Specifically, the goal of the learner is to ident…
Decentralized and Equitable Optimal Transport
Ivan Lau, Shiqian Ma, César A. Uribe
This paper considers the decentralized (discrete) optimal transport (D-OT) problem. In this setting, a network of agents seeks to design a transportation plan jointly, where the co…