Computer Science – Information Theory
Scientific paper
2005-04-21
Computer Science
Information Theory
Scientific paper
A novel, non-trivial, probabilistic upper bound on the entropy of an unknown one-dimensional distribution, given the support of the distribution and a sample from that distribution, is presented. No knowledge beyond the support of the unknown distribution is required, nor is the distribution required to have a density. Previous distribution-free bounds on the cumulative distribution function of a random variable given a sample of that variable are used to construct the bound. A simple, fast, and intuitive algorithm for computing the entropy bound from a sample is provided.
DeStefano Joseph
Learned-Miller Erik
No associations
LandOfFree
A Probabilistic Upper Bound on Differential Entropy does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Probabilistic Upper Bound on Differential Entropy, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Probabilistic Upper Bound on Differential Entropy will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-315127