Testing poisson binomial distributions

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn 2015-January, Issue January, 2015, Pages 1829-1840

  Acharya, Jayadev ^a   Daskalakis, Constantinos ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY;

IDENTITY TESTING; LOWER BOUNDS; NEAR-OPTIMAL ALGORITHMS; POISSON BINOMIAL DISTRIBUTIONS; SAMPLE COMPLEXITY;

POISSON DISTRIBUTION;

EID: 84938263580     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611973730.122     Document Type: Conference Paper

References (22)

1. Jayadev Acharya, Hirakendu Das, Ashkan Jafarpour, Alon Orlitsky, Shengjun Pan, and Ananda Theertha Suresh. Competitive classification and closeness testing. In COLT, pages 22.1-22.18, 2012. 3, 4, 4
2. Tugkan Batu, Lance Fortnow, Eldar Fischer, Ravi Kumar, Ronitt Rubinfeld, and Patrick White. Testing random variables for independence and identity. In FOCS, pages 442-451, 2001. 1, 1.1
3. Tugkan Batu, Ravi Kumar, and Ronitt Rubinfeld. Sublinear algorithms for testing monotone and unimodal distributions. In STOC, pages 381-390. ACM, 2004. 1
4. A. Barbour and Torgny Lindvall. Translated poisson approximation for markov chains. Journal of Theoretical Probability, 2007. 5
5. Mikhail Belkin and Kaushik Sinha. Polynomial learning of distribution families. In FOCS, pages 103-112, 2010. 1
6. Siu On Chan, Ilias Diakonikolas, Rocco A. Servedio, and Xiaorui Sun. Learning mixtures of structured distributions over discrete domains. In SODA, pages 1380-1394, 2013. 1
7. Siu On Chan, Ilias Diakonikolas, Paul Valiant, and Gregory Valiant. Optimal algorithms for testing closeness of discrete distributions. In SODA, pages 1193-1203, 2014. 4
8. Thomas M. Cover and Joy A. Thomas. Elements of information theory (2. ed.). Wiley, 2006. 4
9. Constantinos Daskalakis, Ilias Diakonikolas, and Rocco A. Servedio. Learning poisson binomial distributions. In STOC, pages 709-728, 2012. 1, 1.1, 1.1, 3, 1, 3.2, 2
10. Constantinos Daskalakis, Ilias Diakonikolas, Rocco A. Servedio, Gregory Valiant, and Paul Valiant. Testing k-modal distributions: Optimal algorithms via reductions, pages 1833-1852, 2013. 1
11. Ilias Diakonikolas, Daniel M. Kane, and Vladimir Nikishkin. Testing identity of structured distributions, abs/1410.2266, 2014. 1
12. Luc Devroye and Gabor Lugosi. Combinatorial methods in density estimation. Springer, 2001. 9
13. Jon Feldman, Ryan O'Donnell, and Rocco A. Servedio. Learning mixtures of product distributions over discrete domains. In FOCS, pages 501-510, 2005. 1
14. Oded Goldreich and Dana Ron. On testing expansion in bounded-degree graphs. Electronic Colloquium on Computational Complexity (ECCC), 7(20), 2000. 1
15. Kirill Levchenko. Chernoff bound. http://cseweb.ucsd.edu/klevchen/techniques/chernoff.pdf. 2
16. Michael Mitzenmacher and Eli Upfal. Probability and computing: Randomized algorithms and probabilistic analysis. Cambridge University Press, 2005. 2
17. Ankur Moitra and Gregory Valiant. Settling the polynomial learnability of mixtures of gaussians. In FOCS, pages 93-102, 2010. 1
18. Liam Paninski. Variational minimax estimation of discrete distributions under kl loss. In NIPS, 2004. 4
19. Liam Paninski. A coincidence-based test for uniformity given very sparsely sampled discrete data. IEEE Transactions on Information Theory, 54(10):4750-4755, 2008. 1, 1, 1.1
20. Adrian Rollin. Translated poisson approximation using exchangeable pair couplings. The Annals of Applied Probability, 17(5/6):1596-1614, 10 2007. 5, 2,4
21. Gregory Valiant and Paul Valiant. Estimating the unseen: an n/log(n)-sample estimator for entropy and support size, shown optimal via new cits. In STOC. ACM, 2011. 1, 1.1
22. Gregory Valiant and Paul Valiant. An automatic inequality prover and instance optimal identity testing. FOCS, 2014. (document), 1, 1.1