Part of the Lecture Notes in Computer Science book series (LNCS, volume 4123)
Lower Bounds for Divergence in the Central Limit Theorem
A method for finding asymptotic lower bounds on information divergence is developed and used to determine the rate of convergence in the Central Limit Theorem.
KeywordsCentral Limit Theorem Fisher Information Exponential Family Hermite Polynomial Central Moment
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 5.Harremoës, P.: Convergence to the Poisson distribution in information divergence, Technical Report 2, Mathematical department, University of Copenhagen (2003)Google Scholar
- 6.Jaynes, E.T.: Information theory and statistical mechanics, I and II. Physical Reviews 106 and 108, 620–630, 171–190 (1957)Google Scholar
- 7.Johnson, O., Barron, A.: Fisher information inequalities and the central limit theorem (preprint, 2001)Google Scholar
- 11.Pearson, K.: Mathematical contributions to the theory of evolution, xix; second supplement to a memoir on skew variation. Philos. Trans. Roy. Soc. London Ser. A 216, 257–429 (1916)Google Scholar
© Springer-Verlag Berlin Heidelberg 2006