Rényi divergence
E41069
Rényi divergence is a family of information-theoretic measures that generalize Kullback–Leibler divergence to quantify the dissimilarity between probability distributions, parameterized by an order α.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Rényi divergence canonical | 4 |
How this entity was disambiguated
This entity first appeared as the object of triple T310411 — resolving that mention is where its identity was fixed. The disambiguator weighed these candidate entities and picked the highlighted one (or “None”, minting a new entity). This is how homonymy is resolved: the same surface form can point to different entities.
NED1
Entity disambiguation (via context triple)
gpt-5-mini-2025-08-07
Target entity: Rényi divergence Context triple: [Rényi entropy, relatedTo, Rényi divergence]
-
A.
Kullback–Leibler divergence
Kullback–Leibler divergence is a fundamental information-theoretic measure that quantifies how one probability distribution differs from a reference distribution.
-
B.
Rényi entropy
Rényi entropy is a generalized measure of information and uncertainty that extends Shannon entropy by introducing a tunable order parameter to emphasize different aspects of a probability distribution.
-
C.
Shannon entropy
Shannon entropy is a fundamental measure in information theory that quantifies the average uncertainty or information content in a random variable or message source.
-
D.
Shannon–Khinchin axioms
The Shannon–Khinchin axioms are a set of fundamental conditions that uniquely characterize Shannon entropy as the standard measure of information and uncertainty in probability theory and information theory.
-
E.
Tsallis entropy
Tsallis entropy is a generalized, nonadditive entropy measure in statistical mechanics and information theory that extends Shannon entropy to better describe complex, nonextensive systems.
- F. None of above. chosen
- G. Unsure - the case is ambiguous/there is not enough information to decide.
NED2
Entity disambiguation (via description)
gpt-5-mini-2025-08-07
Target entity: Rényi divergence Target entity description: Rényi divergence is a family of information-theoretic measures that generalize Kullback–Leibler divergence to quantify the dissimilarity between probability distributions, parameterized by an order α.
-
A.
Kullback–Leibler divergence
Kullback–Leibler divergence is a fundamental information-theoretic measure that quantifies how one probability distribution differs from a reference distribution.
-
B.
Rényi entropy
Rényi entropy is a generalized measure of information and uncertainty that extends Shannon entropy by introducing a tunable order parameter to emphasize different aspects of a probability distribution.
-
C.
Shannon entropy
Shannon entropy is a fundamental measure in information theory that quantifies the average uncertainty or information content in a random variable or message source.
-
D.
Shannon–Khinchin axioms
The Shannon–Khinchin axioms are a set of fundamental conditions that uniquely characterize Shannon entropy as the standard measure of information and uncertainty in probability theory and information theory.
-
E.
Tsallis entropy
Tsallis entropy is a generalized, nonadditive entropy measure in statistical mechanics and information theory that extends Shannon entropy to better describe complex, nonextensive systems.
- F. None of above. chosen
Statements (48)
| Predicate | Object |
|---|---|
| instanceOf |
divergence measure
ⓘ
f-divergence ⓘ information-theoretic measure ⓘ statistical distance ⓘ |
| alsoKnownAs | α-divergence ⓘ |
| appliedIn |
adversarial learning
ⓘ
differential privacy ⓘ generative modeling ⓘ variational inference ⓘ |
| asymmetric | true ⓘ |
| category | information divergence ⓘ |
| dataProcessingInequality | true for α ∈ [0,1) ∪ (1,∞) ⓘ |
| definedFor |
continuous probability distributions
ⓘ
discrete probability distributions ⓘ |
| dependsOn | Radon–Nikodym derivative dP/dQ when P is absolutely continuous w.r.t. Q ⓘ |
| domain | pairs of probability distributions ⓘ |
| equalsAt | Kullback–Leibler divergence when α = 1 ⓘ |
| equalsZeroWhen | P = Q almost surely ⓘ |
| field |
information theory
ⓘ
machine learning ⓘ statistics ⓘ |
| generalizes | Kullback–Leibler divergence ⓘ |
| hasContinuousLimitAt | α → 1 to KL divergence ⓘ |
| introducedBy | Alfréd Rényi ⓘ |
| introducedIn | 1961 ⓘ |
| isMetric | false ⓘ |
| monotoneIn | order α ⓘ |
| namedAfter | Alfréd Rényi ⓘ |
| nonNegative | true ⓘ |
| parameterizedBy | order α ⓘ |
| relatedTo |
Bhattacharyya distance
ⓘ
Chernoff information ⓘ Hellinger distance ⓘ Tsallis divergence ⓘ |
| relatedToAt |
max-divergence when α → ∞
ⓘ
min-divergence when α → 0 ⓘ |
| requires | P absolutely continuous with respect to Q for finite value ⓘ |
| satisfies | D_α(P‖Q) ≥ 0 ⓘ |
| specialCaseAt |
α = 0
ⓘ
α = 1 ⓘ α = ∞ ⓘ |
| usedIn |
distributional robustness
ⓘ
hypothesis testing ⓘ information geometry ⓘ
linked to:
Riemannian manifolds
machine learning regularization ⓘ privacy analysis ⓘ robust statistics ⓘ |
| usedToDefine | Rényi entropy ⓘ |
How these facts were elicited
The pipeline generated the facts above by prompting gpt-5.1 with this entity's name + description and the instruction below.
Instruction
You are a knowledge base construction expert. Given a subject entity and a description of it, return factual statements that you know for the subject as a JSON list of dictionaries(triples), where keys must be "subject", "predicate" and "object". The number of facts may be very high, between 25 to 50 or more, for very popular subjects. For less popular subjects, the number of facts can be very low, like 5 or 10. # Requirements - If you don't know the subject at all, return an empty list. - If the subject is not a named entity, return an empty list. - Include at least one triple where predicate is "instanceOf". - Do not get too wordy. - Separate several objects into multiple triples with one object.
Input
Subject: Rényi divergence Description of subject: Rényi divergence is a family of information-theoretic measures that generalize Kullback–Leibler divergence to quantify the dissimilarity between probability distributions, parameterized by an order α.
Referenced by (4)
Full triples — surface form annotated when it differs from this entity's canonical label.