English
Related papers

Related papers: A Variational Formula for Infinity-R\'{e}nyi Diver…

200 papers

The redundancy for universal lossless compression of discrete memoryless sources in Campbell's setting is characterized as a minimax R\'enyi divergence, which is shown to be equal to the maximal $\alpha$-mutual information via a generalized…

Information Theory · Computer Science 2019-03-12 Semih Yagli , Yücel Altuğ , Sergio Verdú

We consider the problem of guessing the realization of a random variable but under more general Tsallis' non-extensive entropic framework rather than the classical Maxwell-Boltzman-Gibbs-Shannon framework. We consider both the conditional…

Information Theory · Computer Science 2019-05-21 Abhik Ghosh

We introduce a bottleneck method for learning data representations based on information deficiency, rather than the more traditional information sufficiency. A variational upper bound allows us to implement this method efficiently. The…

Information Theory · Computer Science 2020-11-05 Pradeep Kr. Banerjee , Guido Montúfar

Differential privacy is a notion of privacy that has become very popular in the database community. Roughly, the idea is that a randomized query mechanism provides sufficient privacy protection if the ratio between the probabilities of two…

Information Theory · Computer Science 2010-12-22 Mário S. Alvim , Konstantinos Chatzikokolakis , Pierpaolo Degano , Catuscia Palamidessi

In this paper we study certain properties of R\'{e}nyi entropy functionals $H_\alpha(\mathcal{P})$ on the space of probability distributions over $\mathbb{Z}_+$. Primarily, continuity and convergence issues are addressed. Some properties…

Information Theory · Computer Science 2020-08-13 Mladen Kovačević , Ivan Stanojević , Vojin Šenk

We derive an exponentially decaying upper-bound on the unnormalized amount of information leaked to the wire-tapper in Wyner's wire-tap channel setting. We characterize the exponent of the bound as a function of the randomness used by the…

Information Theory · Computer Science 2016-02-12 Mani Bastani Parizi , Emre Telatar

The study of quantum and classical correlations between subsystems is fundamental to understanding many-body physics. In quantum information theory, the quantum mutual information, $I(A;B)$, is a measure of correlation between the…

Quantum Physics · Physics 2026-01-21 Uri Levin , Noa Feldman , Moshe Goldstein

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

The problem of guessing a random string is revisited. A close relation between guessing and compression is first established. Then it is shown that if the sequence of distributions of the information spectrum satisfies the large deviation…

Information Theory · Computer Science 2010-08-12 Manjesh Kumar Hanawal , Rajesh Sundaresan

In this work, we consider the problem of bounding the values of a covariance function corresponding to a continuous-time stationary stochastic process or signal. Specifically, for two signals whose covariance functions agree on a finite…

Signal Processing · Electrical Eng. & Systems 2021-10-07 Filip Elvander , Johan Karlsson , Toon van Waterschoot

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

A new sharp inequality featuring the differential R\'enyi entropy, the R\'enyi divergence and the R\'enyi cross-entropy of a pair of probability density functions is established. The equality is reached when one of the probability density…

Information Theory · Computer Science 2026-03-10 Razvan Gabriel Iagar , David Puertas-Centeno

In this paper, we analyze the asymptotics of the normalized remaining uncertainty of a source when a compressed or hashed version of it and correlated side-information is observed. For this system, commonly known as Slepian-Wolf source…

Information Theory · Computer Science 2016-06-01 Vincent Y. F. Tan , Masahito Hayashi

The probability leakage of model M with respect to evidence E is defined. Probability leakage is a kind of model error. It occurs when M implies that events $y$, which are impossible given E, have positive probability. Leakage does not…

Statistics Theory · Mathematics 2012-01-18 William M. Briggs

An information-theoretic privacy mechanism design is studied, where an agent observes useful data $Y$ which is correlated with the private data $X$. The agent wants to reveal the information to a user, hence, the agent utilizes a privacy…

Information Theory · Computer Science 2026-01-09 Amirreza Zamani , Parastoo Sadeghi , Mikael Skoglund

This paper introduces a variational approximation framework using direct optimization of what is known as the {\it scale invariant Alpha-Beta divergence} (sAB divergence). This new objective encompasses most variational objectives that use…

Machine Learning · Statistics 2018-05-22 Jean-Baptiste Regli , Ricardo Silva

This thesis develops a new divergence that generalizes relative entropy and can be used to compare probability measures without a requirement of absolute continuity. We establish properties of the divergence, and in particular derive and…

Probability · Mathematics 2020-11-18 Yixiang Mao

The achievable error-exponent pairs for the type I and type II errors are characterized in a hypothesis testing setup where the observation consists of independent and identically distributed samples from either a known joint probability…

Information Theory · Computer Science 2018-09-19 Amos Lapidoth , Christoph Pfister

We examine the relationship between privacy metrics that utilize information density to measure information leakage between a private and a disclosed random variable. Firstly, we prove that bounding the information density from above or…

Information Theory · Computer Science 2024-02-21 Leonhard Grosse , Sara Saeidian , Parastoo Sadeghi , Tobias J. Oechtering , Mikael Skoglund

The Principle of Maximum Entropy is a rigorous technique for estimating an unknown distribution given partial information while simultaneously minimizing bias. However, an important requirement for applying the principle is that the…

Information Theory · Computer Science 2026-02-03 Kenneth Bogert , Matthew Kothe
‹ Prev 1 4 5 6 7 8 10 Next ›