2000 character limit reached
A short characterization of relative entropy
Published 13 Dec 2017 in cs.IT, math-ph, math.IT, math.MP, math.ST, and stat.TH | (1712.04903v1)
Abstract: We prove characterization theorems for relative entropy (also known as Kullback-Leibler divergence), q-logarithmic entropy (also known as Tsallis entropy), and q-logarithmic relative entropy. All three have been characterized axiomatically before, but we show that earlier proofs can be simplified considerably, at the same time relaxing some of the hypotheses.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.