The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.
Some inequalities for information divergence and related measures of discrimination
Abstract
Inequalities which connect information divergence with other measures of discrimination or distance between probability distributions are used in information theory and its applications to mathematical statistics, ergodic theory, and other scientific fields. We suggest new inequalities of this type, often based on underlying identities. As a consequence, we obtain certain improvements of the well-known Pinsker inequality. Our study depends on two measures of discrimination, called capacitory discrimination and triangular discrimination. The discussion contains references to related research and comparison with other measures of discrimination, e.g., Ali-Silvey-Csiszar (1996, 1966) divergences and, in particular, the Hellinger distance.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
On Information and Sufficiency
Kullback, S., & Leibler, R. A. (1951) · The Annals of Mathematical Statistics · doi:10.1214/aoms/1177729694 · Cited by 20,193
Information theory and statistics
(1959) · Journal of the Franklin Institute · doi:10.1016/0016-0032(59)90368-0 · Cited by 7,094
Divergence measures based on the Shannon entropy
Lin, J. (1991) · IEEE Transactions on Information Theory · doi:10.1109/18.61115 · Cited by 5,140
Information 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
Information Theory and Statistics.
Dwass, M., & Kullback, S. (1960) · The American Mathematical Monthly · doi:10.2307/2309734 · Cited by 1,537
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
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
Harmonic Analysis on Semigroups
Berg, C., Christensen, J. P. R., & Ressel, P. (1984) · Graduate Texts in Mathematics · doi:10.1007/978-1-4612-1128-0 · Cited by 1,134
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
Information-theoretic determination of minimax rates of convergence
Yang, Y., & Barron, A. (1999) · The Annals of Statistics · doi:10.1214/aos/1017939142 · Cited by 555
Information and Information Stability of Random Variables and Processes.
Brillinger, D. R., Pinsker, M. S., & Feinstein, A. (1964) · Applied Statistics · doi:10.2307/2985711 · Cited by 378
Entropy and Distance of Random Graphs with Application to Structural Pattern Recognition
Wong, A. K. C., & You, M. (1985) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.1985.4767707 · Cited by 291
Bounding $\bar{d}$-distance by informational divergence: a method to prove measure concentration
Marton, K. (1996) · The Annals of Probability · doi:10.1214/aop/1039639365 · Cited by 261
Rates of convergence for minimum contrast estimators
Birgé, L., & Massart, P. (1993) · Probability Theory and Related Fields · doi:10.1007/bf01199316 · Cited by 211
A simple proof of the blowing-up lemma (Corresp.)
Marton, K. (1986) · IEEE Transactions on Information Theory · doi:10.1109/tit.1986.1057176 · Cited by 172
Information-theoretical optimization techniques
Topsøe, F. (1979) · Czech digital mathematics library · Cited by 134
Information inequalities and concentration of measure
Dembo, A. (1997) · The Annals of Probability · doi:10.1214/aop/1024404424 · Cited by 91
A NEW DIRECTED DIVERGENCE MEASURE AND ITS CHARACTERIZATION∗
LIN, J., & Wong, S. K. M. (1990) · International Journal of General Systems · doi:10.1080/03081079008935097 · Cited by 68
Ryabko, B. Y. (1981) · IEEE Transactions on Information Theory · doi:10.1109/tit.1981.1056409 · Cited by 20
Ecole d’Eté de Probabilités de Saint-Flour VII-1977
Dacunha‐Castelle, D., Heyer, H., & Roynette, B. (1978) · Lecture notes in mathematics · doi:10.1007/bfb0062796 · Cited by 16
Cited by
A new metric for probability distributions
Endres, D. M., & Schindelin, J. E. (2003) · IEEE Transactions on Information Theory · doi:10.1109/tit.2003.813506 · Cited by 1,163
Effects of Distance Measure Choice on K-Nearest Neighbor Classifier Performance: A Review
Abu Alfeilat, H. A., Hassanat, A. B. A., Lasassmeh, O., Tarawneh, A. S., Alhasanat, M. B., Eyal Salman, H. S., & Prasath, V. B. S. (2019) · Big Data · doi:10.1089/big.2018.0175 · Cited by 667
Jensen-Shannon divergence and Hilbert space embedding
Fuglede, B., & Topsoe, F. (2004) · International Symposium onInformation Theory, 2004. ISIT 2004. Proceedings. · doi:10.1109/isit.2004.1365067 · Cited by 612
Self-citationOn 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
Families of Alpha- Beta- and Gamma- Divergences: Flexible and Robust Measures of Similarities
Cichocki, A., & Amari, S.-I. (2010) · Entropy · doi:10.3390/e12061532 · Cited by 459
Metadata
- Authors
- Topsoe, F.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2000-07
- Volume
- 46
- Issue
- 4
- Pages
- 1602-1609
- ISSN
- 0018-9448 (ISSN-L)
- OpenAlex
- W2159902206
- Cited by
- 325
- References
- 21
- FWCI
- 19.40
- Type
- journal article
- Language
- en
- Open access
- closed
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.