The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Rényi Divergence and Kullback-Leibler Divergence
Open accessAbstract
Rényi divergence is related to Rényi entropy much like Kullback-Leibler divergence is related to Shannon's entropy, and comes up in many settings. It was introduced by Rényi as a measure of information that satisfies almost the same axioms as Kullback-Leibler divergence, and depends on a parameter that is called its order. In particular, the Rényi divergence of order 1 equals the Kullback-Leibler divergence. We review and extend the most important properties of Rényi divergence and Kullback-Leibler divergence, including convexity, continuity, limits of\(\sigma \)-algebras, and the relation of the special order 0 to the Gaussian dichotomy and contiguity. We also show how to generalize the Pythagorean inequality to orders different from 1, and we extend the known equivalence between channel capacity and minimax redundancy to continuous channel inputs (for all orders) and present several other minimax results.
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
Vaart, A. W. V. D. (1998) · doi:10.1017/cbo9780511802256 · Cited by 4,159
$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
On equivalence of infinite product measures
Kakutani, S. (1948) · The Annals of Mathematics · doi:10.2307/1969123 · Cited by 424
Cited by
Mironov, I. (2017) · 2017 IEEE 30th Computer Security Foundations Symposium (CSF) · doi:10.1109/csf.2017.11 · Cited by 1,255
A Review of Domain Adaptation without Target Labels
Kouw, W. M., & Loog, M. (2021) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2019.2945942 · Cited by 613
Scalable Private Learning with PATE
Papernot, N., Song, S., Mironov, I., Raghunathan, A., Talwar, K., & Erlingsson, Ú. (2018) · arXiv · doi:10.48550/arxiv.1802.08908 · Cited by 373
Subsampled Rényi Differential Privacy and Analytical Moments Accountant
Wang, Y.-X., Balle, B., & Kasiviswanathan, S. (2018) · arXiv · doi:10.48550/arxiv.1808.00087 · Cited by 224
Rethinking Lossy Compression: The Rate-Distortion-Perception Tradeoff
Blau, Y., & Michaeli, T. (2019) · arXiv · doi:10.48550/arxiv.1901.07821 · Cited by 198
AutoLog: Anomaly detection by deep autoencoding of system logs
Catillo, M., Pecchia, A., & Villano, U. (2022) · Expert Systems with Applications · doi:10.1016/j.eswa.2021.116263 · Cited by 102
Regimes of Classical Simulability for Noisy Gaussian Boson Sampling
Qi, H., Brod, D. J., Quesada, N., & García-Patrón, R. (2020) · Physical Review Letters · doi:10.1103/physrevlett.124.100502 · Cited by 87
Privacy Amplification by Iteration
Feldman, V., Mironov, I., Talwar, K., & Thakurta, A. (2018) · 2018 IEEE 59th Annual Symposium on Foundations of Computer Science (FOCS) · doi:10.1109/focs.2018.00056 · Cited by 80
Sadeghian, H., & Wang, Z. (2020) · Renewable Energy · doi:10.1016/j.renene.2019.09.117 · Cited by 64
A measure for intrinsic information
Barbosa, L. S., Marshall, W., Streipert, S., Albantakis, L., & Tononi, G. (2020) · Scientific Reports · doi:10.1038/s41598-020-75943-4 · Cited by 42
Wang, S., Zhou, X., Li, C., Wang, S., Li, Y., Tan, T., & Zheng, H. (2025) · Research · doi:10.34133/research.1029 · Cited by 29
Machine Unlearning via Algorithmic Stability
Ullah, E., Mai, T., Rao, A., Rossi, R., & Arora, R. (2021) · arXiv · doi:10.48550/arxiv.2102.13179 · Cited by 26
Quantum-Assisted Joint Multi-Objective Routing and Load Balancing for Socially-Aware Networks
Alanis, D., Hu, J., Botsinis, P., Babar, Z., Ng, S. X., & Hanzo, L. (2016) · IEEE Access · doi:10.1109/access.2016.2629671 · Cited by 15
Edge-MultiAI: Multi-Tenancy of Latency-Sensitive Deep Learning Applications on Edge
Zobaed, S., Mokhtari, A., Champati, J. P., Kourouma, M., & Salehi, M. A. (2022) · 2022 IEEE/ACM 15th International Conference on Utility and Cloud Computing (UCC) · doi:10.1109/ucc56403.2022.00012 · Cited by 15
One Model to Rig Them All: Diverse Skeleton Rigging with UniRig
Zhang, J.-P., Pu, C.-F., Guo, M.-H., Cao, Y.-P., & Hu, S.-M. (2025) · ACM Transactions on Graphics · doi:10.1145/3730930 · Cited by 12
Quantifying and mitigating recorder-induced variability in ecological acoustic indices
(2024) · doi:10.1016/j.ecoinf.2024.102668 · Cited by 7
EANA: Reducing Privacy Risk on Large-scale Recommendation Models
Ning, L., Chien, S., Song, S., Chen, M., Xue, Y., & Berlowitz, D. (2022) · Proceedings of the 16th ACM Conference on Recommender Systems · doi:10.1145/3523227.3546769 · Cited by 5
Ab-initio amino acid sequence design from protein text description with ProtDAT
Guo, X.-Y., Li, Y.-F., Liu, Y., Pan, X., & Shen, H.-B. (2025) · Nature Communications · doi:10.1038/s41467-025-65562-w · Cited by 3
Quantifying and mitigating recorder-induced variability in ecological acoustic indices
Luna-Naranjo, D., Martínez, J. D., Sánchez-Giraldo, C., Daza, J. M., & López, J. D. (2023) · doi:10.1101/2023.10.16.562620 · Cited by 7
Large-scale methods for distributionally robust optimization
Levy, D., Carmon, Y., Duchi, J. C., & Sidford, A. (2020) · arXiv · doi:10.48550/arxiv.2010.05893 · Cited by 52
Metadata
- Authors
- van Erven, T., & Harremoes, P.
- Venue
- IEEE Transactions on Information Theory
- Published
- 2014-07
- Volume
- 60
- Issue
- 7
- Pages
- 3797-3820
- ISSN
- 0018-9448 (ISSN-L)
- 1557-9654
- OpenAlex
- W2026653933
- Cited by
- 1,555
- References
- 3
- FWCI
- 34.50
- 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.
