Abstract

Concave functions play a central role in optimization. So-called exponentially concave functions are of similar importance in information theory. In this paper, we comprehensively discuss mathematical properties of the class of exponentially concave functions, like closedness under linear and convex combination and relations to quasi−, Jensen− and Schur-concavity. Information theoretic quantities such as self-information and (scaled) entropy are shown to be exponentially concave. Furthermore, new inequalities for the Kullback-Leibler divergence, for the entropy of mixture distributions, and for mutual information are derived.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.