English
Related papers

Related papers: Minimum entropy of a log-concave variable for fixe…

200 papers

Uniform continuity bounds on entropies are generally expressed in terms of a single distance measure between a pair of probability distributions or quantum states, typically, the total variation distance or trace distance. However, if an…

Quantum Physics · Physics 2025-01-09 Michael G. Jabbour , Nilanjana Datta

The mutual information (MI) between two random variables is an important correlation measure in data analysis. The Shannon entropy of a joint probability distribution is the variable part under fixed marginals. We aim to minimize and…

Optimization and Control · Mathematics 2025-09-08 Paula Franke , Kay Hamacher , Paul Manns

Maximum likelihood estimation of a log-concave probability density is formulated as a convex optimization problem and shown to have an equivalent dual formulation as a constrained maximum Shannon entropy problem. Closely related maximum…

Methodology · Statistics 2010-11-16 Roger Koenker , Ivan Mizera

Consider the problem of estimating the Shannon entropy of a distribution over $k$ elements from $n$ independent samples. We show that the minimax mean-square error is within universal multiplicative constant factors of $$\Big(\frac{k }{n…

Information Theory · Computer Science 2016-02-19 Yihong Wu , Pengkun Yang

Shannon entropy is widely used to quantify the uncertainty of discrete random variables. But when normalized to the unit interval, as is often done in practice, it no longer conveys the alphabet sizes of the random variables being studied.…

Information Theory · Computer Science 2022-07-26 John Çamkıran

We study the convergence of states under continuous-time depolarizing channels with full rank fixed points in terms of the relative entropy. The optimal exponent of an upper bound on the relative entropy in this case is given by the…

Quantum Physics · Physics 2017-12-06 Alexander Müller-Hermes , Daniel Stilck Franca , Michael M. Wolf

Entropy and differential entropy are important quantities in information theory. A tractable extension to singular random variables-which are neither discrete nor continuous-has not been available so far. Here, we present such an extension…

Information Theory · Computer Science 2017-01-04 Günther Koliander , Georg Pichler , Erwin Riegler , Franz Hlawatsch

We prove the following type of discrete entropy monotonicity for sums of isotropic, log-concave, independent and identically distributed random vectors $X_1,\dots,X_{n+1}$ on $\mathbb{Z}^d$: $$ H(X_1+\cdots+X_{n+1}) \geq H(X_1+\cdots+X_{n})…

Probability · Mathematics 2025-12-18 Matthieu Fradelizi , Lampros Gavalakis , Martin Rapaport

Shannon's analysis of the fundamental capacity limits for memoryless communication channels has been refined over time. In this paper, the maximum volume $M_\avg^*(n,\epsilon)$ of length-$n$ codes subject to an average decoding error…

Information Theory · Computer Science 2016-12-28 Pierre Moulin

A lower bound on the probability $P(0<X<\delta)$ for all real $\delta>0$ and all random variables $X$ with log-concave p.d.f.'s such that $EX=0$ and $EX^2=1$ is obtained.

Probability · Mathematics 2026-02-09 Iosif Pinelis

The Shannon lower bound is one of the few lower bounds on the rate-distortion function that holds for a large class of sources. In this paper, it is demonstrated that its gap to the rate-distortion function vanishes as the allowed…

Information Theory · Computer Science 2016-11-17 Tobias Koch

We prove a quantitative dimension-free bound in the Shannon-Stam Entropy inequality for the convolution of two log-concave distributions in dimension d interms of the spectral gap of the density. The method relies on the analysis of the…

Functional Analysis · Mathematics 2013-06-04 Keith Ball , Van Hoang Nguyen

This paper addresses the correspondence between linear inequalities of Shannon entropy and differential entropy for sums of independent group-valued random variables. We show that any balanced (with the sum of coefficients being zero)…

Information Theory · Computer Science 2016-09-12 Ashok Vardhan Makkuva , Yihong Wu

This work studies the location estimation problem for a mixture of two rotation invariant log-concave densities. We demonstrate that Least Squares EM, a variant of the EM algorithm, converges to the true location parameter from a randomly…

Machine Learning · Statistics 2019-06-21 Wei Qian , Yuqian Zhang , Yudong Chen

We study the capacity of the power-constrained additive Gaussian channel with an entropy constraint at the input. In particular, we characterize this capacity in the low signal-to-noise ratio regime at small entropy. This follows as a…

Information Theory · Computer Science 2025-04-30 Adway Girish , Shlomo Shamai , Emre Telatar

The entropy per coordinate in a log-concave random vector of any dimension with given density at the mode is shown to have a range of just 1. Uniform distributions on convex bodies are at the lower end of this range, the distribution with…

Information Theory · Computer Science 2024-05-07 Sergey Bobkov , Mokshay Madiman

Convergence properties of Shannon Entropy are studied. In the differential setting, it is shown that weak convergence of probability measures, or convergence in distribution, is not enough for convergence of the associated differential…

Information Theory · Computer Science 2016-11-18 Francisco J. Piera , Patricio Parada

Shannon's Entropy Power Inequality can be viewed as characterizing the minimum differential entropy achievable by the sum of two independent random variables with fixed differential entropies. The entropy power inequality has played a key…

Information Theory · Computer Science 2012-07-31 Varun Jog , Venkat Anantharam

Standard variational lower bounds used to train latent variable models produce biased estimates of most quantities of interest. We introduce an unbiased estimator of the log marginal likelihood and its gradients for latent variable models…

Machine Learning · Computer Science 2020-07-14 Yucen Luo , Alex Beatson , Mohammad Norouzi , Jun Zhu , David Duvenaud , Ryan P. Adams , Ricky T. Q. Chen

We prove a Bernstein-type bound for the difference between the average of negative log-likelihoods of independent discrete random variables and the Shannon entropy, both defined on a countably infinite alphabet. The result holds for the…

Information Theory · Computer Science 2021-06-24 Yunpeng Zhao