Csiszár f-divergence
E841827
Csiszár f-divergence is a broad class of statistical distance measures between probability distributions defined via convex functions, encompassing many well-known divergences such as Kullback–Leibler and total variation as special cases.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Csiszár f-divergence canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T10060490 — 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: Csiszár f-divergence Context triple: [Tsallis divergence, relatedTo, Csiszár f-divergence]
-
A.
Rényi divergence
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 α.
-
B.
Tsallis divergence
Tsallis divergence is a generalized measure of statistical distance between probability distributions derived from Tsallis entropy, often used in nonextensive statistical mechanics and information theory.
-
C.
Kullback–Leibler divergence
Kullback–Leibler divergence is a fundamental information-theoretic measure that quantifies how one probability distribution differs from a reference distribution.
-
D.
Jensen–Shannon divergence
Jensen–Shannon divergence is a symmetrized and smoothed measure of dissimilarity between probability distributions, widely used in information theory and machine learning.
-
E.
Bhattacharyya distance
Bhattacharyya distance is a statistical measure of similarity between two probability distributions, often used in pattern recognition and classification to quantify their overlap.
- 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: Csiszár f-divergence Target entity description: Csiszár f-divergence is a broad class of statistical distance measures between probability distributions defined via convex functions, encompassing many well-known divergences such as Kullback–Leibler and total variation as special cases.
-
A.
Rényi divergence
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 α.
-
B.
Tsallis divergence
Tsallis divergence is a generalized measure of statistical distance between probability distributions derived from Tsallis entropy, often used in nonextensive statistical mechanics and information theory.
-
C.
Kullback–Leibler divergence
Kullback–Leibler divergence is a fundamental information-theoretic measure that quantifies how one probability distribution differs from a reference distribution.
-
D.
Jensen–Shannon divergence
Jensen–Shannon divergence is a symmetrized and smoothed measure of dissimilarity between probability distributions, widely used in information theory and machine learning.
-
E.
Bhattacharyya distance
Bhattacharyya distance is a statistical measure of similarity between two probability distributions, often used in pattern recognition and classification to quantify their overlap.
- F. None of above. chosen
Statements (50)
| Predicate | Object |
|---|---|
| instanceOf |
information theoretic quantity
ⓘ
statistical distance measure ⓘ statistical divergence ⓘ |
| alsoKnownAs |
Csiszár–Morimoto divergence
NERFINISHED
ⓘ
f-divergence NERFINISHED ⓘ |
| appliesTo |
continuous probability distributions
ⓘ
discrete probability distributions ⓘ probability measures on measurable spaces ⓘ |
| basedOn | convex function on positive reals ⓘ |
| codomain | nonnegative real numbers ⓘ |
| conditionOn | f(1) = 0 ⓘ |
| definedBetween | probability distributions ⓘ |
| domain | pairs of probability measures ⓘ |
| equalsZeroIfAndOnlyIf | two distributions are equal almost surely ⓘ |
| field |
information theory
ⓘ
machine learning ⓘ probability theory ⓘ statistics ⓘ |
| generalizes |
Hellinger distance
NERFINISHED
ⓘ
Itakura–Saito divergence NERFINISHED ⓘ Jensen–Shannon divergence NERFINISHED ⓘ Kullback–Leibler divergence NERFINISHED ⓘ Neyman chi-squared divergence ⓘ Pearson chi-squared divergence NERFINISHED ⓘ reverse Kullback–Leibler divergence ⓘ total variation distance ⓘ |
| hasSpecialCase |
Hellinger distance via f(t) = (
√t - 1
)^2
ⓘ
Kullback–Leibler divergence via f(t) = t log t ⓘ reverse Kullback–Leibler divergence via f(t) = -log t ⓘ total variation distance via f(t) = 0.5|t-1| ⓘ |
| introducedBy | Imre Csiszár NERFINISHED ⓘ |
| introducedInContextOf | information measures of probability distributions ⓘ |
| namedAfter | Imre Csiszár NERFINISHED ⓘ |
| nonNegative | true ⓘ |
| property |
convex in each argument under suitable parametrization
ⓘ
does not satisfy triangle inequality in general ⓘ not symmetric in general ⓘ |
| relatedTo |
Bregman divergence
ⓘ
f-information ⓘ |
| requires |
absolute continuity of one measure with respect to the other for integral form
ⓘ
convex function ⓘ |
| satisfies | data processing inequality ⓘ |
| usedFor |
density ratio estimation
ⓘ
distributional robustness ⓘ generative modeling ⓘ goodness-of-fit testing ⓘ hypothesis testing ⓘ information geometry ⓘ robust statistics ⓘ variational inference ⓘ |
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: Csiszár f-divergence Description of subject: Csiszár f-divergence is a broad class of statistical distance measures between probability distributions defined via convex functions, encompassing many well-known divergences such as Kullback–Leibler and total variation as special cases.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.