Convexity/concavity of renyi entropy and α-mutual information
Date
2015
Authors
Ho, S.W.
Verdú, S.
Editors
Advisors
Journal Title
Journal ISSN
Volume Title
Type:
Conference paper
Citation
IEEE International Symposium on Information Theory - Proceedings, 2015, vol.2015-June, iss.7282554, pp.745-749
Statement of Responsibility
Conference Name
International symposium on information theory (14 Jun 2015 - 19 Jun 2015 : Hong Kong)
Abstract
Entropy is well known to be Schur concave on finite alphabets. Recently, the authors have strengthened the result by showing that for any pair of probability distributions P and Q with Q majorized by P, the entropy of Q is larger than the entropy of P by the amount of relative entropy D(P||Q). This result applies to P and Q defined on countable alphabets. This paper shows the counterpart of this result for the Rényi entropy and the Tsallis entropy. Lower bounds on the difference in the Rényi (or Tsallis) entropy are given in terms of a new divergence which is related to the Rényi (or Tsallis) divergence. This paper also considers a notion of generalized mutual information, namely α-mutual information, which is defined through the Rényi divergence. The convexity/concavity for different ranges of α is shown. A sufficient condition for the Schur concavity is discussed and upper bounds on α-mutual information are given in terms of the Rényi entropy.
School/Discipline
Dissertation Note
Provenance
Description
Access Status
Rights
Copyright 2015 IEEE