Pinsker's Inequality

In information theory, Pinsker's inequality, named after its inventor Mark Semenovich Pinsker, is an inequality that bounds the total variation distance (or statistical distance) in terms of the Kullback–Leibler divergence.
The inequality is tight up to constant factors.

Formal statement

Pinsker's inequality states that, if $P$ and $Q$ are two probability distributions on a measurable space $(X, \Sigma)$, then

:$\delta(P,Q) \le \sqrt,$

where

:$\delta(P,Q)=\sup \bigl\$

is the total variation distance (or statistical distance) between $P$ and $Q$ and

:$D_(P\parallel Q) = \operatorname_P \left( \log \frac \right) = \int_X \left( \log \frac \right) \, \mathrm P$

is the Kullback–Leibler divergence in nats. When the sample space $X$ is a finite set, the Kullback–Leibler divergence is given by

: $D_(P\parallel Q) = \sum_ \left( \log \frac\right) P(i)\!$

Note that in terms of the total variation norm $\, P - Q \,$ of the signed measure $P - Q$, Pinsker's inequality differs from the one given above by a factor of two:
:$\, P - Q \, \le \sqrt.$

A proof of Pinsker's inequality uses the partition inequality for ''f''-divergences.

Alternative version

Note that the expression of Pinsker inequality depends on what basis of logarithm is used in the definition of KL-divergence. $D_$ is defined using $\ln$ (logarithm in base $e$), whereas $D$ is typically defined with $\log_2$ (logarithm in base 2). Then,

:$D(P\parallel Q) =\frac.$

Given the above comments, there is an alternative statement of Pinsker's inequality in some literature that relates information divergence to variation distance:
:$D(P\parallel Q) = \frac \ge \frac V^2(p, q),$
i.e.,
:$\sqrt \ge \frac,$
in which
:$V(p, q) = \sum_ , p(x) - q(x) ,$
is the (non-normalized) variation distance between two probability density functions $p$ and $q$ on the same alphabet $\mathcal$.

This form of Pinsker's inequality shows that "convergence in divergence" is stronger notion than "convergence in variation distance".

A simple proof by John Pollard is shown by letting $r(x)=P(x)/Q(x)-1 \ge -1$:
:\begin
D_(P \parallel Q)
&= E_Q 1+r(x))\log(1+r(x))-r(x) \\&\ge \fracE_Q\left frac\right \\&\ge \frac\frac
&\text
\\&= \fracE_Q +r(x)_31_\text
__\\&=_\fracV(p,_q)^2.
\end<_math>
Here_Titu's_l.html" ;"title="r(x), ]^2
&\text E_Q +r(x)/31 \text
\\&= \fracV(p, q)^2.
\end
Here Titu's lemma is also known as Sedrakyan's inequality.

Note that the lower bound from Pinsker's inequality is vacuous for any distributions where $D_(P\parallel Q)>2$, since the total variation distance is at most $1$. For such distributions, an alternative bound can be used, due to Bretagnolle and Huber (see, also, Tsybakov):
:$\delta(P,Q) \le \sqrt.$

History

Pinsker first proved the inequality with a greater constant. The inequality in the above form was proved independently by Kullback, Csiszár, and Kemperman.

Inverse problem

A precise inverse of the inequality cannot hold: for every $\varepsilon > 0$, there are distributions $P_\varepsilon, Q$ with $\delta(P_\varepsilon,Q)\le\varepsilon$ but $D_(P_\varepsilon\parallel Q) = \infty$. An easy example is given by the two-point space $\$ with $Q(0) = 0, Q(1) = 1$ and $P_\varepsilon(0) = \varepsilon, P_\varepsilon(1) = 1-\varepsilon$.

However, an inverse inequality holds on finite spaces $X$ with a constant depending on $Q$.see Lemma 4.1 in More specifically, it can be shown that with the definition $\alpha_Q := \min_ Q(x)$ we have for any measure $P$ which is absolutely continuous to $Q$
: $\frac D_(P\parallel Q) \le \frac \delta(P,Q)^2.$

As a consequence, if $Q$ has full support (i.e. $Q(x) > 0$ for all $x \in X$), then

: $\delta(P,Q)^2 \le \frac D(P\parallel Q) \le \frac \delta(P,Q)^2.$

References

{{Reflist

Further reading

* Thomas M. Cover and Joy A. Thomas: ''Elements of Information Theory'', 2nd edition, Willey-Interscience, 2006
* Nicolo Cesa-Bianchi and Gábor Lugosi: ''Prediction, Learning, and Games'', Cambridge University Press, 2006

Information theory
Probabilistic inequalities>r(x), 2
&\text E_Q +r(x)/31 \text
\\&= \fracV(p, q)^2.
\end
Here Titu's lemma is also known as Sedrakyan's inequality.

Note that the lower bound from Pinsker's inequality is vacuous for any distributions where $D_(P\parallel Q)>2$, since the total variation distance is at most $1$. For such distributions, an alternative bound can be used, due to Bretagnolle and Huber (see, also, Tsybakov):
:$\delta(P,Q) \le \sqrt.$

History

Pinsker first proved the inequality with a greater constant. The inequality in the above form was proved independently by Kullback, Csiszár, and Kemperman.

Inverse problem

A precise inverse of the inequality cannot hold: for every $\varepsilon > 0$, there are distributions $P_\varepsilon, Q$ with $\delta(P_\varepsilon,Q)\le\varepsilon$ but $D_(P_\varepsilon\parallel Q) = \infty$. An easy example is given by the two-point space $\$ with $Q(0) = 0, Q(1) = 1$ and $P_\varepsilon(0) = \varepsilon, P_\varepsilon(1) = 1-\varepsilon$.

However, an inverse inequality holds on finite spaces $X$ with a constant depending on $Q$.see Lemma 4.1 in More specifically, it can be shown that with the definition $\alpha_Q := \min_ Q(x)$ we have for any measure $P$ which is absolutely continuous to $Q$
: $\frac D_(P\parallel Q) \le \frac \delta(P,Q)^2.$

As a consequence, if $Q$ has full support (i.e. $Q(x) > 0$ for all $x \in X$), then

: $\delta(P,Q)^2 \le \frac D(P\parallel Q) \le \frac \delta(P,Q)^2.$

References

{{Reflist

Further reading

* Thomas M. Cover and Joy A. Thomas: ''Elements of Information Theory'', 2nd edition, Willey-Interscience, 2006
* Nicolo Cesa-Bianchi and Gábor Lugosi: ''Prediction, Learning, and Games'', Cambridge University Press, 2006

Information theory
Probabilistic inequalities