The DOI matches its Crossref record; 72 of the 72 references it cites were found in a registry or an index.
$f$ -Divergence Inequalities
Open accessAbstract
This paper develops systematic approaches to obtain f -divergence inequalities, dealing with pairs of probability measures defined on arbitrary alphabets. Functional domination is one such approach, where special emphasis is placed on finding the best possible constant upper bounding a ratio of f -divergences. Another approach used for the derivation of bounds among f -divergences relies on moment inequalities and the logarithmic-convexity property, which results in tight bounds on the relative entropy and Bhattacharyya distance in terms of χ2divergences. A rich variety of bounds are shown to hold under boundedness assumptions on the relative information. Special attention is devoted to the total variation distance and its relation to the relative information and relative entropy, including “reverse Pinsker inequalities,” as well as on the Eγdivergence, which generalizes the total variation distance. Pinsker's inequality is extended for this type of f -divergence, a result which leads to an inequality linking the relative entropy and relative information spectrum. Integral expressions of the Rényi divergence in terms of the relative information spectrum are derived, leading to bounds on the Rényi divergence in terms of either the variational distance or relative entropy.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Boyd, S., & Vandenberghe, L. (2004) · doi:10.1017/cbo9780511804441 · Cited by 56,601
Wu, Y. (1999) · Technometrics · doi:10.1080/00401706.1999.10485951 · Cited by 27,221
On Information and Sufficiency
Kullback, S., & Leibler, R. A. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729694 · Cited by 20,193
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2005) · doi:10.1002/047174882x · Cited by 13,791
Corless, R. M., Gonnet, G. H., Hare, D. E. G., Jeffrey, D. J., & Knuth, D. E. (1996) · Advances in Computational Mathematics · doi:10.1007/bf02124750 · Cited by 6,150
Divergence measures based on the Shannon entropy
Lin, J. (1991) · IEEE Transactions on Information Theory · doi:10.1109/18.61115 · Cited by 5,140
Pearson, K. (1900) · The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science · doi:10.1080/14786440009463897 · Cited by 4,069
On Measures of Entropy and Information
Rényi, A. (1961) · Project Euclid (Cornell University) · Cited by 4,031
Channel Coding Rate in the Finite Blocklength Regime
Polyanskiy, Y., Poor, H. V., & Verdu, S. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2043769 · Cited by 3,885
Self-citationInformation Theory: Coding Theorems for Discrete Memoryless Systems
Csiszár, I., & Körner, J. (2014) · REAL-EOD (Library of the Hungarian Academy of Sciences and the Information Center Oriental Collection) · Cited by 3,246
Introduction to Nonparametric Estimation
Tsybakov, A. B. (2009) · Springer Series in Statistics · doi:10.1007/b13794 · Cited by 2,486
An invariant form for the prior probability in estimation problems
Jeffreys, H. (1946) · Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences · doi:10.1098/rspa.1946.0056 · Cited by 2,323
The Divergence and Bhattacharyya Distance Measures in Signal Selection
Kailath, T. (1967) · IEEE Transactions on Communications · doi:10.1109/tcom.1967.1089532 · Cited by 1,856
Concentration Inequalities: A Nonasymptotic Theory of Independence
Boucheron, S., Lugosi, G., & Massart, P. (2013) · doi:10.1093/acprof:oso/9780199535255.001.0001 · Cited by 1,768
$I$-Divergence Geometry of Probability Distributions and Minimization Problems
Csiszar, I. (1975) · The Annals of Probability · doi:10.1214/aop/1176996454 · Cited by 1,645
Rényi Divergence and Kullback-Leibler Divergence
van Erven, T., & Harremoes, P. (2014) · IEEE Transactions on Information Theory · doi:10.1109/tit.2014.2320500 · Cited by 1,555
Information-type measures of difference of probability distributions and indirect observation
Csiszár, I. (1967) · Studia Scientiarum Mathematicarum Hungarica · Cited by 1,332
Asymptotic Methods in Statistical Decision Theory
Cam, L. L. (1986) · Springer Series in Statistics · doi:10.1007/978-1-4612-4946-7 · Cited by 1,317
Information Theory: Coding Theorems for Discrete Memoryless Systems
Csiszár, I., & Körner, J. (2011) · Cambridge University Press eBooks · doi:10.1017/cbo9780511921889 · Cited by 1,308
A General Class of Coefficients of Divergence of One Distribution from Another
Ali, S. M., & Silvey, S. D. (1966) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1966.tb00626.x · Cited by 1,205
On Choosing and Bounding Probability Metrics
Gibbs, A. L., & Su, F. E. (2002) · International Statistical Review · doi:10.1111/j.1751-5823.2002.tb00178.x · Cited by 1,163
Goodness-of-Fit Statistics for Discrete Multivariate Data
Read, T. R. C., & Cressie, N. A. C. (1988) · Springer Series in Statistics · doi:10.1007/978-1-4612-4578-0 · Cited by 771
Information and information stability of random variables and processes
(1964) · Journal of the Franklin Institute · doi:10.1016/0016-0032(64)90319-9 · Cited by 758
Goodness-of-fit statistics for discrete multivariate data
(1989) · Choice Reviews Online · doi:10.5860/choice.26-2740 · Cited by 738
On Divergences and Informations in Statistics and Information Theory
Liese, F., & Vajda, I. (2006) · IEEE Transactions on Information Theory · doi:10.1109/tit.2006.881731 · Cited by 593
Information Theory and Statistics: A Tutorial
Csiszár, I., & Shields, P. C. (2004) · now publishers, Inc. eBooks · doi:10.1561/9781933019543 · Cited by 589
Logarithmic Sobolev inequalities for finite Markov chains
Diaconis, P., & Saloff-Coste, L. (1996) · The Annals of Applied Probability · doi:10.1214/aoap/1034968224 · Cited by 479
Theory of statistical inference and information
Vajda, I. (1989) · Medical Entomology and Zoology · Cited by 463
Pearson, K. (1992) · Springer Series in Statistics · doi:10.1007/978-1-4612-4380-9_2 · Cited by 454
Liese, F., & Vajda, I. (1987) · Cited by 452
Asymptotics in statistics : some basic concepts
Cam, L. M. L., & Yang, G. L. (1990) · Springer eBooks · Cited by 444
Information Theory: Name index
Csiszár, I., & Körner, J. (2011) · Cited by 436
Information Theory: Basic notation and conventions
Csiszár, I., & Körner, J. (2011) · Cited by 436
Convergence of Estimates Under Dimensionality Restrictions
LeCam, L. (1973) · The Annals of Statistics · doi:10.1214/aos/1193342380 · Cited by 422
Information Theory and Statistics: A Tutorial
Csiszár, I., & Shields, P. C. (2004) · Foundations and Trends™ in Communications and Information Theory · doi:10.1561/0100000004 · Cited by 420
A lower bound for discrimination information in terms of variation (Corresp.)
Kullback, S. (1967) · IEEE Transactions on Information Theory · doi:10.1109/tit.1967.1053968 · Cited by 359
Entropy and the Central Limit Theorem
Barron, A. R. (1986) · The Annals of Probability · doi:10.1214/aop/1176992632 · Cited by 359
Minimum Contrast Estimators on Sieves: Exponential Bounds and Rates of Convergence
Birgé, L., Massart, P., & Birgé, L. (1998) · Bernoulli · doi:10.2307/3318720 · Cited by 326
Some inequalities for information divergence and related measures of discrimination
Topsoe, F. (2000) · IEEE Transactions on Information Theory · doi:10.1109/18.850703 · Cited by 325
Uncertainty, Information, and Sequential Experiments
DeGroot, M. H. (1962) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177704567 · Cited by 266
Approximate Distributions of Order Statistics: With Applications to Nonparametric Statistics
Reiss, R. (1989) · Cited by 262
Concentration of measure inequalities for Markov chains and $\Phi$-mixing processes
Samson, P.-M. (2000) · The Annals of Probability · doi:10.1214/aop/1019160125 · Cited by 224
Estimation des densit�s: risque minimax
Bretagnolle, J., & Huber, C. (1979) · Zeitschrift f�r Wahrscheinlichkeitstheorie und Verwandte Gebiete · doi:10.1007/bf00535278 · Cited by 218
A measure concentration inequality for contracting markov chains
Marton, K. (1996) · Geometric and Functional Analysis · doi:10.1007/bf02249263 · Cited by 202
A class of measures of informativity of observation channels
Csiszár, I. (1972) · Periodica Mathematica Hungarica · doi:10.1007/bf02018661 · Cited by 199
Introduction to non-parametric estimation
Streater, R. F. (2009) · Cambridge University Press eBooks · doi:10.1017/cbo9780511642401.015 · Cited by 182
Concentration of Measure Inequalities in Information Theory, Communications, and Coding
Raginsky, M., & Sason, I. (2013) · Foundations and Trends in Communications and Information Theory · doi:10.1561/0100000064 · Cited by 180
Self-citationInformation, Divergence and Risk for Binary ExperimentsPreprint
Reid, M. D., & Williamson, R. C. (2009) · arXiv (Cornell University) · doi:10.48550/arxiv.0901.0356 · Cited by 168
Heyer, H. (1982) · Springer series in statistics · doi:10.1007/978-1-4613-8218-8_7 · Cited by 147
Arimoto channel coding converse and Rényi divergence
Polyanskiy, Y., & Verdú, S. (2010) · Allerton Conference on Communication, Control, and Computing · doi:10.1109/allerton.2010.5707067 · Cited by 138
Mutual information, metric entropy and cumulative relative entropy risk
Haussler, D. H., & Opper, M. (1997) · The Annals of Statistics · doi:10.1214/aos/1030741081 · Cited by 137
Rényi divergence measures for commonly used univariate continuous distributions
Gil, M., Alajaji, F., & Linder, T. (2013) · Information Sciences · doi:10.1016/j.ins.2013.06.018 · Cited by 112
Estimating Mutual Information Via Kolmogorov Distance
Zhang, Z. (2007) · IEEE Transactions on Information Theory · doi:10.1109/tit.2007.903122 · Cited by 99
On the optimum rate of transmitting information
Kemperman, J. H. B. (1969) · Lecture notes in mathematics · doi:10.1007/bfb0079123 · Cited by 96
Dissipation of Information in Channels With Input Constraints
Polyanskiy, Y., & Wu, Y. (2015) · IEEE Transactions on Information Theory · doi:10.1109/tit.2015.2482978 · Cited by 95
Continuity bounds on the quantum relative entropy
Audenaert, K. M. R., & Eisert, J. (2005) · Journal of Mathematical Physics · doi:10.1063/1.2044667 · Cited by 90
Lower Bounds for the Minimax Risk Using $f$-Divergences, and Applications
Guntuboyina, A. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2110791 · Cited by 88
On Pinsker's and Vajda's Type Inequalities for Csiszár's $f$-Divergences
Gilardoni, G. L. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2068710 · Cited by 83
On thef-divergence and singularity of probability measures
Vajda, I. (1972) · Periodica Mathematica Hungarica · doi:10.1007/bf02018663 · Cited by 82
The Interplay Between Entropy and Variational Distance
Ho, S., & Yeung, R. W. (2010) · IEEE Transactions on Information Theory · doi:10.1109/tit.2010.2080452 · Cited by 78
Continuity bounds on the quantum relative entropy — II
Audenaert, K. M. R., & Eisert, J. (2011) · Journal of Mathematical Physics · doi:10.1063/1.3657929 · Cited by 69
On Rényi measures and hypothesis testing
Shayevitz, O. (2011) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2011.6034266 · Cited by 55
ON METRIC DIVERGENCES OF PROBABILITY MEASURES
Vajda, I. (2009) · Czech digital mathematics library · Cited by 33
Liu, J., Cuff, P., & Verdú, S. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2642111 · Cited by 32
Channels With Cost Constraints: Strong Converse and Dispersion
Kostina, V., & Verdú, S. (2015) · IEEE Transactions on Information Theory · doi:10.1109/tit.2015.2409261 · Cited by 26
On the Rényi Divergence, Joint Range of Relative Entropies, and a Channel Coding Theorem
Sason, I. (2015) · IEEE Transactions on Information Theory · doi:10.1109/tit.2015.2504100 · Cited by 25
Self-citationExtremum Problems With Total Variation Distance and Their Applications
Charalambous, C. D., Tzortzis, I., Loyka, S. L., & Charalambous, T. (2014) · IEEE Transactions on Automatic Control · doi:10.1109/tac.2014.2321951 · Cited by 24
Fong, S. L., & Tan, V. Y. F. (2016) · Cited by 16
Projection Theorems for the Rényi Divergence on $\alpha $ -Convex Sets
Kumar, M. A., & Sason, I. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2595586 · Cited by 13
Self-citationThe Value of Observation for Monitoring Dynamic Systems
Even-Dar, E., Kakade, S. M., & Mansour, Y. (n.d.) · Cited by 11
Strong Converse Theorems for Classes of Multimessage Multicast Networks: A Rényi Divergence Approach
Fong, S. L., & Tan, V. Y. F. (2016) · IEEE Transactions on Information Theory · doi:10.1109/tit.2016.2584082 · Cited by 10
Channels with cost constraints: Strong converse and dispersion
Kostina, V., & Verdú, S. (2013) · IEEE International Symposium on Information Theory (ISIT) · doi:10.1109/isit.2013.6620524 · Cited by 9
Cited by
Wasserstein Introspective Neural Networks
Lee, K., Xu, W., Fan, F., & Tu, Z. (2018) · 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2018.00390 · Cited by 56
Metadata
- Authors
- Sason, I., & Verdu, S.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2016-11
- Volume
- 62
- Issue
- 11
- Pages
- 5973-6006
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2518143623
- Cited by
- 292
- References
- 72
- FWCI
- 35.51
- Type
- journal article
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.