# On the Detection of Mixture Distributions with applications to the Most Biased Coin Problem

25 Mar 2016Kevin JamiesonDaniel HaasBen Recht

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 $\theta_1 \in (0,1)$, and "light" coins with mean $\theta_0 \in (0,\theta_1)$, where heavy coins are drawn from the bag with probability $\alpha \in (0,1/2)$... (read more)

PDF Abstract

No code implementations yet. Submit your code now