Tsallis divergence
E212974
concept in nonextensive statistical mechanics
f-divergence generalization
information theoretic measure
statistical 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.
All labels observed (1)
| Label | Occurrences |
|---|---|
| Tsallis divergence canonical | 1 |
How this entity was disambiguated
This entity first appeared as the object of triple T1836107 — 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: Tsallis divergence Context triple: [Rényi divergence, relatedTo, Tsallis 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.
Kullback–Leibler divergence
Kullback–Leibler divergence is a fundamental information-theoretic measure that quantifies how one probability distribution differs from a reference distribution.
-
C.
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.
-
D.
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.
-
E.
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.
- 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: Tsallis divergence Target entity description: 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.
-
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.
Kullback–Leibler divergence
Kullback–Leibler divergence is a fundamental information-theoretic measure that quantifies how one probability distribution differs from a reference distribution.
-
C.
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.
-
D.
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.
-
E.
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.
- F. None of above. chosen
Statements (47)
| Predicate | Object |
|---|---|
| instanceOf |
concept in nonextensive statistical mechanics
ⓘ
f-divergence generalization ⓘ information theoretic measure ⓘ statistical divergence ⓘ |
| appliedIn |
anomalous diffusion modeling
ⓘ
complex systems ⓘ image processing ⓘ pattern recognition ⓘ statistical physics of long-range interactions ⓘ |
| associatedWith |
nonextensive entropy formalism
ⓘ
power-law distributed systems ⓘ |
| basedOn | Tsallis entropy ⓘ |
| category | generalized information measure ⓘ |
| dependsOn |
probability distribution P
ⓘ
probability distribution Q ⓘ |
| domain |
continuous probability distributions
ⓘ
discrete probability distributions ⓘ |
| field |
information theory
ⓘ
machine learning ⓘ statistical mechanics ⓘ statistics ⓘ |
| generalizes | Kullback–Leibler divergence ⓘ |
| invariantUnder | relabeling of outcomes ⓘ |
| mathematicalForm | q-deformed divergence ⓘ |
| namedAfter | Constantino Tsallis ⓘ |
| parameter | entropic index q ⓘ |
| property |
equals zero iff P = Q (under suitable conditions)
ⓘ
nonnegative ⓘ |
| reducesTo | Kullback–Leibler divergence when q → 1 ⓘ |
| relatedTo |
Bregman divergence
ⓘ
Csiszár f-divergence ⓘ Rényi divergence ⓘ |
| requires | choice of entropic index q ≠ 1 ⓘ |
| specialCaseOf | q-deformed information measures ⓘ |
| usedFor |
constructing generalized maximum entropy principles
ⓘ
defining generalized relative entropy ⓘ measuring statistical distance between probability distributions ⓘ robust loss functions in learning algorithms ⓘ |
| usedIn |
clustering
ⓘ
hypothesis testing ⓘ information geometry ⓘ model selection ⓘ nonextensive statistical mechanics ⓘ robust statistics ⓘ signal processing ⓘ statistical inference ⓘ |
| yearProposed | 1990s (approximate) ⓘ |
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: Tsallis divergence Description of subject: 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.
Referenced by (1)
Full triples — surface form annotated when it differs from this entity's canonical label.