Information theoretical properties of Tsallis entropies
By Shigeru Furuichi. 2004
166 citations recorded by the source corpus.
A chain rule and a subadditivity for the entropy of type β, which is one of the nonadditive entropies, were derived by Daroczy. In this paper, we study the further relations among Tsallis type entropies which are typical nonadditive entropies. The chain rule is generalized by showing it for Tsallis relative entropy and the nonadditive entropy. We show some inequalities related to Tsallis entropies, especially the strong subadditivity for Tsallis type entropies and the subadditivity for the nonadditive entropies. The subadditivity and the strong subadditivity naturally lead to define Tsallis mutual entropy and Tsallis conditional mutual entropy, respectively, and then we show again chain rules for Tsallis mutual entropies. We give properties of entropic distances in terms of Tsallis entropies. Finally we show parametrically extended results based on information theory.
View Paper: https://www.semanticscholar.org/paper/e2a58cd046e30a995e54118cea5dcda9af7b9847
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Noah A. Smith
- André F. T. Martins
- Eric P. Xing
- Mário A. T. Figueiredo
- Pedro M. Q. Aguiar
- Yoshua Bengio
- Percy Liang
- Dani Yogatama
Citations in the corpus
- Nonextensive Information Theoretic Kernels on Measures (2009, methodology): “Nonextensive generalizations of information theory have been proposed (Furuichi, 2006).”