Pinsker's inequality
E1355537
UNEXPLORED
Pinsker's inequality is a fundamental result in information theory that bounds the total variation distance between two probability distributions in terms of their Kullback–Leibler divergence.
All labels observed (2)
| Label | Occurrences |
|---|---|
| Pinsker's inequality canonical | 2 |
| Pinsker inequality | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T19039821 — 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: Pinsker's inequality Context triple: [Mark Pinsker, notableFor, Pinsker's inequality]
-
A.
Bennett inequality
Bennett inequality is a probabilistic bound that provides exponential tail estimates for sums of independent random variables, refining classical concentration inequalities like Bernstein’s.
-
B.
Fano inequality
Fano inequality is a fundamental result in information theory that provides a lower bound on the probability of classification or decoding error in terms of conditional entropy.
-
C.
Azuma–Hoeffding inequality
The Azuma–Hoeffding inequality is a concentration inequality that bounds the probability of large deviations for martingales with bounded differences, generalizing Hoeffding’s inequality to dependent sequences.
-
D.
Chebyshev inequalities
Chebyshev inequalities are probabilistic bounds that limit how much a random variable’s values can deviate from its mean in terms of its variance.
-
E.
Chernoff bound
The Chernoff bound is a probabilistic inequality that gives exponentially decreasing upper bounds on the tail probabilities of sums of independent random variables.
- 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: Pinsker's inequality Target entity description: Pinsker's inequality is a fundamental result in information theory that bounds the total variation distance between two probability distributions in terms of their Kullback–Leibler divergence.
-
A.
Bennett inequality
Bennett inequality is a probabilistic bound that provides exponential tail estimates for sums of independent random variables, refining classical concentration inequalities like Bernstein’s.
-
B.
Fano inequality
Fano inequality is a fundamental result in information theory that provides a lower bound on the probability of classification or decoding error in terms of conditional entropy.
-
C.
Azuma–Hoeffding inequality
The Azuma–Hoeffding inequality is a concentration inequality that bounds the probability of large deviations for martingales with bounded differences, generalizing Hoeffding’s inequality to dependent sequences.
-
D.
Chebyshev inequalities
Chebyshev inequalities are probabilistic bounds that limit how much a random variable’s values can deviate from its mean in terms of its variance.
-
E.
Chernoff bound
The Chernoff bound is a probabilistic inequality that gives exponentially decreasing upper bounds on the tail probabilities of sums of independent random variables.
- F. None of above. chosen
Referenced by (3)
Full triples — surface form annotated when it differs from this entity's canonical label.
linked to: Pinsker's inequality