<ul><li>Consider two problems about an unknown probability distribution $p$.</li><li>The best known upper bound for problem (1) uses a general algorithm for learning the histogram of the distribution $p$.</li><li>We show that testing can be done more efficiently than learning the histogram.</li><li>This algorithm also provides a better solution to problem (2), producing larger lower bounds on support size than what follows from previous work.</li></ul>

Testing Support Size More Efficiently Than Learning Histograms

Discover more