Chernoff information
E205228
Chernoff information is a measure in information theory and statistics that quantifies the exponential rate at which the error probability decays when optimally distinguishing between two probability distributions.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Chernoff information canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T1836108 — 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: Chernoff information Context triple: [Rényi divergence, relatedTo, Chernoff information]
-
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.
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.
Cramér–Rao bound
The Cramér–Rao bound is a fundamental result in statistical estimation theory that gives a lower limit on the variance of any unbiased estimator of a parameter, characterizing the best possible precision achievable.
-
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.
Kullback–Leibler divergence
Kullback–Leibler divergence is a fundamental information-theoretic measure that quantifies how one probability distribution differs from a reference distribution.
- 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: Chernoff information Target entity description: Chernoff information is a measure in information theory and statistics that quantifies the exponential rate at which the error probability decays when optimally distinguishing between two probability distributions.
-
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.
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.
Cramér–Rao bound
The Cramér–Rao bound is a fundamental result in statistical estimation theory that gives a lower limit on the variance of any unbiased estimator of a parameter, characterizing the best possible precision achievable.
-
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.
Kullback–Leibler divergence
Kullback–Leibler divergence is a fundamental information-theoretic measure that quantifies how one probability distribution differs from a reference distribution.
- F. None of above. chosen
Statements (44)
| Predicate | Object |
|---|---|
| instanceOf |
hypothesis testing performance measure
ⓘ
information theoretic measure ⓘ statistical divergence ⓘ |
| appearsIn |
asymptotic analysis of Bayesian error probability
ⓘ
multi-hypothesis testing generalizations ⓘ |
| appliesTo |
continuous probability distributions
ⓘ
discrete probability distributions ⓘ |
| category |
information geometry
ⓘ
statistical decision theory ⓘ |
| comparedWith |
Jensen–Shannon divergence
ⓘ
total variation distance ⓘ |
| definedOver | pair of probability distributions ⓘ |
| dependsOn | Chernoff parameter s ⓘ |
| field |
information theory
ⓘ
statistics ⓘ |
| mathematicalForm | defined as the negative logarithm of the minimum Chernoff moment over s in [0,1] ⓘ |
| namedAfter | Herman Chernoff ⓘ |
| optimizationDomain | Chernoff parameter in interval [0,1] ⓘ |
| property |
equals zero if and only if the two distributions are identical
ⓘ
larger values indicate better distinguishability ⓘ nonnegative ⓘ symmetric in its two distributions ⓘ |
| relatedTo |
Bhattacharyya distance
ⓘ
Chernoff bound ⓘ Kullback–Leibler divergence ⓘ Neyman–Pearson theory of hypothesis testing ⓘ
surface form:
Neyman–Pearson lemma
Rényi divergence ⓘ error exponent ⓘ large deviations theory ⓘ |
| role | characterizes optimal Bayesian error exponent between two distributions ⓘ |
| symbol | C(P,Q) ⓘ |
| usedFor |
asymptotic error exponent analysis
ⓘ
binary hypothesis testing ⓘ channel coding error exponent analysis ⓘ classification error analysis ⓘ distinguishing two probability distributions ⓘ pattern recognition ⓘ performance analysis of statistical tests ⓘ quantifying exponential decay rate of error probability ⓘ signal detection ⓘ |
| usedIn |
communications theory
ⓘ
information-theoretic security ⓘ machine learning ⓘ statistical signal processing ⓘ |
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: Chernoff information Description of subject: Chernoff information is a measure in information theory and statistics that quantifies the exponential rate at which the error probability decays when optimally distinguishing between two probability distributions.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.