Difference between revisions of "Entropy, Relative Entropy, Mutual Information"
Jump to navigation
Jump to search
(→Lemma) |
|||
Line 40: | Line 40: | ||
=== Lemma 1 === | === Lemma 1 === | ||
<math>H\left(X\right)\ge 0</math> | <math>H\left(X\right)\ge 0</math> | ||
+ | |||
+ | '''Proof''': Since <math>0 \ge p\left(x\right) \ge 1</math>, then we can see from Eq. ({{EquationNote|4}}) that |
Revision as of 16:39, 25 June 2020
Contents
Definitions
Entropy
- a measure of the uncertainty of a random variable
- The entropy of a random variable is a measure of the uncertainty of the random variable
- it is a measure of the amount of information required on the average to describe the random variable
Relative Entropy
- a measure of the distance between two distributions
- a measure of the inefficiency of assuming that the distribution is when the true distribution is .
Mutual Information
- a measure of the amount of information that one random variable contains about another random variable
Entropy
Definitions:
- a measure of the uncertainty of a random variable
- The entropy of a random variable is a measure of the uncertainty of the random variable
- it is a measure of the amount of information required on the average to describe the random variable
The entropy of a discrete random variable, , is
-
(1)
where has a probability mass function (pmf), , and an alphabet .
Expected Value
For a discrete random variable, , with probability mass function, , the expected value of is
-
(2)
For a discrete random variable, , with probability mass function, , the expected value of is
-
(3)
Consider the case where . We get
-
(4)
Lemma 1
Proof: Since , then we can see from Eq. (4) that