Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Review Help
Search
Learning Poisson binomial distributions
Daskalakis C., Diakonikolas I., Servedio R.  STOC 2012 (Proceedings of the 44th Symposium on the Theory of Computing, New York, NY, May 19-22, 2012)709-728.2012.Type:Proceedings
Date Reviewed: Jun 25 2012

Class discussions of the Poisson distribution usually take second place to discussions of binomial probability distributions. Cognizant of this, the authors have conducted research on learning an unknown Poisson binomial distribution and present the results in these proceedings. Their purpose is to develop a highly efficient algorithm for dealing with this basic class of distributions independent of the population size.

After an introduction using the practical example of newspaper distribution effectiveness, the paper discusses several theorems and several applications of those theorems. These theorems and proofs are very sophisticated and not for beginners. There is a detailed appendix and reference section consisting of several pages.

In their conclusion, the authors state that they “have essentially settled the sample and time complexity of learning an unknown Poisson binomial distribution.”

Reviewer:  James Van Speybroeck Review #: CR140303 (1211-1167)
Bookmark and Share
  Reviewer Selected
Featured Reviewer
 
 
Distribution Functions (G.3 ... )
 
 
Computations On Discrete Structures (F.2.2 ... )
 
 
Nonparametric Statistics (G.3 ... )
 
Would you recommend this review?
yes
no
Other reviews under "Distribution Functions": Date
Improved estimation of clutter properties in speckled imagery: how to write them and why
Cribari-Neto F., Frery A., Silva M. Computational Statistics & Data Analysis 40(4): 801-824, 2002. Type: Article
Jul 2 2003
Bayesian graphical model determination using decision theory
Corander J. Journal of Multivariate Analysis 85(2): 253-266, 2003. Type: Article
Aug 8 2003
The Wiener index of simply generated random trees
Janson S. Random Structures & Algorithms 22(4): 337-358, 2003. Type: Article
May 14 2004
more...

E-Mail This Printer-Friendly
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud®
Terms of Use
| Privacy Policy