arXiv · math/0111020
Fisher Information inequalities and the Central Limit Theorem
Abstract
We give conditions for an O(1/n) rate of convergence of Fisher information and relative entropy in the Central Limit Theorem. We use the theory of projections in L2 spaces and Poincare inequalities, to provide a better understanding of the decrease in Fisher information implied by results of Barron and Brown. We show that if the standardized Fisher information ever becomes finite then it converges to zero.
Explore related subjects
Keep this discovery
Oliver Johnson, Andrew Barron. 2003-07-04. Fisher Information inequalities and the Central Limit Theorem. https://doi.org/10.1007/s00440-004-0344-0
Cite the original work for its findings. Save a collection to share your selection of sources.