Uncertainty about Uncertainty: Optimal Adaptive Algorithms for Estimating Mixtures of Unknown Coins

Given a mixture between two populations of coins, "positive" coins that each have-unknown and potentially different-bias ≥ 1 2 + ∆ and "negative" coins with bias ≤ 1 2 -∆, we consider the task of estimating the fraction ρ of positive coins to within additive error . We achieve an upper and lower bound of Θ( ρ 2 ∆ 2 log 1 δ ) samples for a 1 -δ probability of success, where crucially, our lower bound applies to all fully-adaptive algorithms. Thus, our sample complexity bounds have tight dependence for every relevant problem parameter. A crucial component of our lower bound proof is a decomposition lemma (see Lemmas 17 and 18) showing how to assemble partially-adaptive bounds into a fully-adaptive bound, which may be of independent interest: though we invoke it for the special case of Bernoulli random variables (coins), it applies to general distributions. We present simulation results to demonstrate the practical efficacy of our approach for realistic problem parameters for crowdsourcing applications, focusing on the "rare events" regime where ρ is small. The fine-grained adaptive flavor of both our algorithm and lower bound contrasts with much previous work in distributional testing and learning.

• We thank Tim Kraska and Yeounoh Chung for bringing these problems to our attention in the data analytics setting, and for contributing to the simulation results in this work. We thank an anonymous reviewer for asking about the δ dependence in lower bounds, which led to the current tight results.