English
Related papers

Related papers: The Renyi Capacity and Center

200 papers

For any channel, the existence of a unique Augustin mean is established for any positive order and probability mass function on the input set. The Augustin mean is shown to be the unique fixed point of an operator defined in terms of the…

Information Theory · Computer Science 2020-01-29 Baris Nakiboglu

This paper introduces "swiveled Renyi entropies" as an alternative to the Renyi entropic quantities put forward in [Berta et al., Phys. Rev. A 91, 022333 (2015)]. What distinguishes the swiveled Renyi entropies from the prior proposal of…

Quantum Physics · Physics 2016-03-22 Frédéric Dupuis , Mark M. Wilde

The Renyi entropies constitute a family of information measures that generalizes the well-known Shannon entropy, inheriting many of its properties. They appear in the form of unconditional and conditional entropies, relative entropies or…

Quantum Physics · Physics 2014-01-28 Martin Müller-Lennert , Frédéric Dupuis , Oleg Szehr , Serge Fehr , Marco Tomamichel

The Renyi entropy is a generalisation of the Shannon entropy that is sensitive to the fine details of a probability distribution. We present results for the Renyi entropy of the totally asymmetric exclusion process (TASEP). We calculate…

Statistical Mechanics · Physics 2017-11-10 Anthony J. Wood , Richard A. Blythe , Martin R. Evans

The R\'enyi and Shannon entropies are information-theoretic measures which have enabled to formulate the position-momentum uncertainty principle in a much more adequate and stringent way than the (variance-based) Heisenberg-like relation.…

Quantum Physics · Physics 2013-05-24 Pablo Sánchez-Moreno , Steeve Zozor , Jesus S. Dehesa

We revisit the problem of asymmetric binary hypothesis testing against a composite alternative hypothesis. We introduce a general framework to treat such problems when the alternative hypothesis adheres to certain axioms. In this case we…

Information Theory · Computer Science 2017-12-12 Marco Tomamichel , Masahito Hayashi

Renyi's "thinning" operation on a discrete random variable is a natural discrete analog of the scaling operation for continuous random variables. The properties of thinning are investigated in an information-theoretic context, especially in…

Information Theory · Computer Science 2010-08-17 Peter Harremoes , Oliver Johnson , Ioannis Kontoyiannis

We discuss some properties of the generalized entropies, called Renyi entropies and their application to the case of continuous distributions. In particular it is shown that these measures of complexity can be divergent, however, their…

Disordered Systems and Neural Networks · Physics 2007-05-23 I. Varga , J. Pipek

Using arguments built on ergodicity, we derive an analytical expression for the Renyi entanglement entropies corresponding to the finite-energy density eigenstates of chaotic many-body Hamiltonians. The expression is a universal function of…

Statistical Mechanics · Physics 2019-03-12 Tsung-Cheng Lu , Tarun Grover

Bounds on information combining are a fundamental tool in coding theory, in particular when analyzing polar codes and belief propagation. They usually bound the evolution of random variables with respect to their Shannon entropy. In recent…

Information Theory · Computer Science 2023-05-05 Christoph Hirche , Xinyue Guan , Marco Tomamichel

This paper gives improved R\'{e}nyi entropy power inequalities (R-EPIs). Consider a sum $S_n = \sum_{k=1}^n X_k$ of $n$ independent continuous random vectors taking values on $\mathbb{R}^d$, and let $\alpha \in [1, \infty]$. An R-EPI…

Information Theory · Computer Science 2016-07-21 Eshed Ram , Igal Sason

We study repeated independent Blackwell experiments; standard examples include drawing multiple samples from a population, or performing a measurement in different locations. In the baseline setting of a binary state of nature, we compare…

Statistics Theory · Mathematics 2020-09-08 Xiaosheng Mu , Luciano Pomatto , Philipp Strack , Omer Tamuz

The analogues of Arimoto's definition of conditional R\'enyi entropy and R\'enyi mutual information are explored for abstract alphabets. These quantities, although dependent on the reference measure, have some useful properties similar to…

Information Theory · Computer Science 2021-10-20 Gautam Aishwarya , Mokshay Madiman

The Renyi distribution ensuring the maximum of a Renyi entropy is investigated for a particular case of a power--law Hamiltonian. Both Lagrange parameters, $\alpha$ and $\beta$ can be excluded. It is found that $\beta$ does not depend on a…

Statistical Mechanics · Physics 2009-11-10 A. G. Bashkirov

In [Berta et al., J. Math. Phys. 56, 022205 (2015)], we recently proposed Renyi generalizations of the conditional quantum mutual information of a tripartite state on $ABC$ (with $C$ being the conditioning system), which were shown to…

Quantum Physics · Physics 2015-09-21 Kaushik P. Seshadreesan , Mario Berta , Mark M. Wilde

This paper presents a novel theoretical study of the general problem of multiple source adaptation using the notion of Renyi divergence. Our results build on our previous work [12], but significantly broaden the scope of that work in…

Machine Learning · Computer Science 2012-05-14 Yishay Mansour , Mehryar Mohri , Afshin Rostamizadeh

The R\'enyi information measures are characterized in terms of their Shannon counterparts, and properties of the former are recovered from first principle via the associated properties of the latter. Motivated by this characterization, a…

Information Theory · Computer Science 2016-03-14 Ofer Shayevitz

R\'enyi divergence is related to R\'enyi entropy much like Kullback-Leibler divergence is related to Shannon's entropy, and comes up in many settings. It was introduced by R\'enyi as a measure of information that satisfies almost the same…

Information Theory · Computer Science 2014-04-25 Tim van Erven , Peter Harremoës

The weak law of large numbers implies that, under mild assumptions on the source, the Renyi entropy per produced symbol converges (in probability) towards the Shannon entropy rate. This paper quantifies the speed of this convergence for…

Information Theory · Computer Science 2017-05-01 Maciej Skorski

We introduce a variant of the R\'enyi entropy definition that aligns it with the well-known H\"older mean: in the new formulation, the r-th order R\'enyi Entropy is the logarithm of the inverse of the r-th order H\"older mean. This brings…

Information Theory · Computer Science 2018-11-16 Francisco José Valverde-Albacete , Carmen Peláez-Moreno
‹ Prev 1 2 3 10 Next ›