Papers
Topics
Authors
Recent
2000 character limit reached

Upper Bounds on the Relative Entropy and Rényi Divergence as a Function of Total Variation Distance for Finite Alphabets (1503.03417v4)

Published 11 Mar 2015 in cs.IT, math.IT, and math.PR

Abstract: A new upper bound on the relative entropy is derived as a function of the total variation distance for probability measures defined on a common finite alphabet. The bound improves a previously reported bound by Csisz\'ar and Talata. It is further extended to an upper bound on the R\'enyi divergence of an arbitrary non-negative order (including $\infty$) as a function of the total variation distance.

Summary

We haven't generated a summary for this paper yet.

Whiteboard

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.