ConceptRenyi entropy / Rényi熵
Rényi Entropy
A generalization of Shannon entropy proposed by Alfréd Rényi. The order α adjusts sensitivity to different parts of a probability distribution: as α→0 it approaches vocabulary richness, α=1 gives Shannon entropy, α=2 gives collision entropy, and α→∞ gives min-entropy.
Timeline (last 90 days)
Nov 9
As α→0, Renyi entropy approaches the observed vocabulary richness (the logarithm of the number of word types that have appeared); at α=1 it equals Shannon entropy; at α=2 it is called collision entropy; and as α→∞ it yields min-entropy.
Unverified50%