English
Related papers

Related papers: Sibson $\alpha$-Mutual Information and Its Variati…

200 papers

We explore a family of information measures that stems from R\'enyi's $\alpha$-Divergences with $\alpha<0$. In particular, we extend the definition of Sibson's $\alpha$-Mutual Information to negative values of $\alpha$ and show several…

Information Theory · Computer Science 2022-02-09 Amedeo Roberto Esposito , Adrien Vandenbroucque , Michael Gastpar

The aim of this work is to provide bounds connecting two probability measures of the same event using R\'enyi $\alpha$-Divergences and Sibson's $\alpha$-Mutual Information, a generalization of respectively the Kullback-Leibler Divergence…

Information Theory · Computer Science 2020-01-20 Amedeo Roberto Esposito , Michael Gastpar , Ibrahim Issa

In this work, we analyse how to define a conditional version of Sibson's $\alpha$-Mutual Information. Several such definitions can be advanced and they all lead to different information measures with different (but similar) operational…

Information Theory · Computer Science 2021-06-09 Amedeo Roberto Esposito , Diyuan Wu , Michael Gastpar

Change of measure inequalities translate divergences between probability measures into explicit bounds on event probabilities, and play an important role in deriving probabilistic guarantees in learning theory, information theory, and…

Information Theory · Computer Science 2026-05-28 Yanxiao Liu , Yijun Fan , Deniz Gündüz

This paper focuses on parameter estimation and introduces a new method for lower bounding the Bayesian risk. The method allows for the use of virtually \emph{any} information measure, including R\'enyi's $\alpha$, $\varphi$-Divergences, and…

Information Theory · Computer Science 2023-03-27 Amedeo Roberto Esposito , Adrien Vandenbroucque , Michael Gastpar

A conditional version of Sibson's $\alpha$-information is defined using a simple closed-form "log-expectation" expression, which satisfies important properties such as consistency, uniform expansion, and data processing inequalities. This…

Information Theory · Computer Science 2021-05-18 Yi Liu , Wei Cheng , Sylvain Guilley , Olivier Rioul

For $\tilde{f}(t) = \exp(\frac{\alpha-1}{\alpha}t)$, this paper proposes a $\tilde{f}$-mean information gain measure. R\'{e}nyi divergence is shown to be the maximum $\tilde{f}$-mean information gain incurred at each elementary event $y$ of…

Information Theory · Computer Science 2024-07-04 Ni Ding , Mohammad Amin Zarrabian , Parastoo Sadeghi

We characterize the growth of the Sibson and Arimoto mutual informations and $\alpha$-maximal leakage, of any order that is at least unity, between a random variable and a growing set of noisy, conditionally independent and…

Information Theory · Computer Science 2021-11-23 Benjamin Wu , Aaron B. Wagner , Ibrahim Issa , G. Edward Suh

In this paper, we present several novel representations of $\alpha$-mutual information ($\alpha$-MI) in terms of R{\' e}nyi divergence and conditional R{\' e}nyi entropy. The representations are based on the variational characterizations of…

Information Theory · Computer Science 2025-05-01 Akira Kamatsuka , Takashiro Yoshida

Mutual information $I(X;Y)$ is a useful definition in information theory to estimate how much information the random variable $Y$ holds about the random variable $X$. One way to define the mutual information is by comparing the joint…

Information Theory · Computer Science 2022-04-14 Bulut Kuskonmaz , Jaron Skovsted Gundersen , Rafal Wisniewski

We study a separable design for computing information measures, where the information measure is computed from learned feature representations instead of raw data. Under mild assumptions on the feature representations, we demonstrate that a…

Information Theory · Computer Science 2025-01-28 Xiangxiang Xu , Lizhong Zheng

Estimating mutual information accurately is pivotal across diverse applications, from machine learning to communications and biology, enabling us to gain insights into the inner mechanisms of complex systems. Yet, dealing with…

Machine Learning · Computer Science 2024-11-12 Nunzio A. Letizia , Nicola Novello , Andrea M. Tonello

In this work, the probability of an event under some joint distribution is bounded by measuring it with the product of the marginals instead (which is typically easier to analyze) together with a measure of the dependence between the two…

Information Theory · Computer Science 2020-10-22 Amedeo Roberto Esposito , Michael Gastpar , Ibrahim Issa

We define a measure of redundant information based on projections in the space of probability distributions. Redundant information between random variables is information that is shared between those variables. But in contrast to mutual…

Information Theory · Computer Science 2013-05-30 Malte Harder , Christoph Salge , Daniel Polani

We generalize the Jensen-Shannon divergence by considering a variational definition with respect to a generic mean extending thereby the notion of Sibson's information radius. The variational definition applies to any arbitrary distance and…

Information Theory · Computer Science 2021-04-16 Frank Nielsen

Two families of dependence measures between random variables are introduced. They are based on the R\'enyi divergence of order $\alpha$ and the relative $\alpha$-entropy, respectively, and both dependence measures reduce to Shannon's mutual…

Information Theory · Computer Science 2019-08-22 Amos Lapidoth , Christoph Pfister

This article develops an analytical framework for studying information divergences and likelihood ratios associated with Poisson processes and point patterns on general measurable spaces. The main results include explicit analytical…

Statistics Theory · Mathematics 2024-10-07 Lasse Leskelä

We formulate a new information-theoretic principle--the shifted composition rule--which bounds the divergence (e.g., Kullback-Leibler or R\'enyi) between the laws of two stochastic processes via the introduction of auxiliary shifts. In this…

Probability · Mathematics 2023-11-27 Jason M. Altschuler , Sinho Chewi

Mutual information is widely used in artificial intelligence, in a descriptive way, to measure the stochastic dependence of discrete random variables. In order to address questions such as the reliability of the empirical value, one must…

Artificial Intelligence · Computer Science 2008-06-26 Marco Zaffalon , Marcus Hutter

Mutual information is widely used in artificial intelligence, in a descriptive way, to measure the stochastic dependence of discrete random variables. In order to address questions such as the reliability of the empirical value, one must…

Artificial Intelligence · Computer Science 2014-08-08 Marco Zaffalon , Marcus Hutter
‹ Prev 1 2 3 10 Next ›