On Pinsker's and Vajda's type inequalities for Csiszár's f-divergences
IEEE Transactions on Information Theory
On the efficiency of bit commitment reductions
ASIACRYPT'11 Proceedings of the 17th international conference on The Theory and Application of Cryptology and Information Security
| Hi-index | 754.90 |
Given two probability distributions Q and P, let ||Q-P||1 and D(Q||P), respectively, denote the L1 distance and divergence between Q and P. We derive a refinement of Pinsker's inequality of the form D(Q||P)≥c(P)||Q-P||12 and characterize the best P-dependent factor c(P). We apply the refined inequality to large deviations and measure concentration.