On the Detection of Mixture Distributions with applications to the Most Biased Coin Problem
It addresses a fundamental trade-off in pure exploration for applications like crowdsourcing and anomaly detection, offering adaptive solutions where prior work required full parameter knowledge.
This paper tackles the most biased coin problem by developing adaptive algorithms that do not require perfect knowledge of parameters like coin means and mixture probability, achieving tight sample complexity bounds up to logarithmic factors. It generalizes these results to infinite-armed bandit problems and provides implications for anomaly detection.
This paper studies the trade-off between two different kinds of pure exploration: breadth versus depth. The most biased coin problem asks how many total coin flips are required to identify a "heavy" coin from an infinite bag containing both "heavy" coins with mean $θ_1 \in (0,1)$, and "light" coins with mean $θ_0 \in (0,θ_1)$, where heavy coins are drawn from the bag with probability $α\in (0,1/2)$. The key difficulty of this problem lies in distinguishing whether the two kinds of coins have very similar means, or whether heavy coins are just extremely rare. This problem has applications in crowdsourcing, anomaly detection, and radio spectrum search. Chandrasekaran et. al. (2014) recently introduced a solution to this problem but it required perfect knowledge of $θ_0,θ_1,α$. In contrast, we derive algorithms that are adaptive to partial or absent knowledge of the problem parameters. Moreover, our techniques generalize beyond coins to more general instances of infinitely many armed bandit problems. We also prove lower bounds that show our algorithm's upper bounds are tight up to $\log$ factors, and on the way characterize the sample complexity of differentiating between a single parametric distribution and a mixture of two such distributions. As a result, these bounds have surprising implications both for solutions to the most biased coin problem and for anomaly detection when only partial information about the parameters is known.