中文
相关论文

相关论文: Bounds on the Entropy of a Function of a Random Va…

200 篇论文

It is well known that the entropy $H(X)$ of a finite random variable is always greater or equal to the entropy $H(f(X))$ of a function $f$ of $X$, with equality if and only if $f$ is one-to-one. In this paper, we give tights bounds on…

信息论 · 计算机科学 2017-04-25 Ferdinando Cicalese , Luisa Gargano , Ugo Vaccaro

A novel, non-trivial, probabilistic upper bound on the entropy of an unknown one-dimensional distribution, given the support of the distribution and a sample from that distribution, is presented. No knowledge beyond the support of the…

信息论 · 计算机科学 2007-07-13 Joseph DeStefano , Erik Learned-Miller

Various lower bounds are established for the entropy of sums, products and their combinations. First, we derive a prime-field analogue of a version of the entropy power inequality established by Tao over torsion-free groups. Next, we prove…

组合数学 · 数学 2026-04-30 Lampros Gavalakis , Marcel K. Goh , Ioannis Kontoyiannis

Let $\mathsf{N}_{\rm d}\left[X\right]=\frac{1}{2\pi {\rm e}}{\rm e}^{2\mathsf{H}\left[X\right]}$ denote the entropy power of the discrete random variable $X$ where $\mathsf{H}\left[X\right]$ denotes the discrete entropy of $X$. In this…

信息论 · 计算机科学 2019-05-09 Ehsan Nekouei , Mikael Skoglund , Karl Henrik Johansson

This paper provides tight bounds on the R\'enyi entropy of a function of a discrete random variable with a finite number of possible values, where the considered function is not one-to-one. To that end, a tight lower bound on the R\'enyi…

信息论 · 计算机科学 2018-12-11 Igal Sason

This paper derives new bounds on the difference of the entropies of two discrete random variables in terms of the local and total variation distances between their probability mass functions. The derivation of the bounds relies on maximal…

信息论 · 计算机科学 2016-11-17 Igal Sason

We study the relative entropy between the empirical estimate of a discrete distribution and the true underlying distribution. If the minimum value of the probability mass function exceeds an $\alpha > 0$ (i.e. when the true underlying…

统计理论 · 数学 2021-09-21 Alankrita Bhatt , Ankit Pensia

The entropy power inequality (EPI) provides lower bounds on the differential entropy of the sum of two independent real-valued random variables in terms of the individual entropies. Versions of the EPI for discrete random variables have…

信息论 · 计算机科学 2013-01-18 Saeid Haghighatshoar , Emmanuel Abbe , Emre Telatar

How low can the joint entropy of $n$ $d$-wise independent (for $d\ge2$) discrete random variables be, subject to given constraints on the individual distributions (say, no value may be taken by a variable with probability greater than $p$,…

离散数学 · 计算机科学 2022-04-05 Dmytro Gavinsky , Pavel Pudlák

We derive an asymptotic lower bound on the Shannon entropy $H$ of sums of $N$ arbitrary iid discrete random variables. The derived bound $H \geq \frac{r(X)}{2}\log(N) + {\it cst}$ is given in terms of the incommensurability rank $r(X)$ of…

信息论 · 计算机科学 2025-08-08 Riccardo Castellano , Pavel Sekatski

A bound for functional $\Delta(F)=\sup_{x\in\mathbb R}|F(x)-\Phi(x)|$ is obtained, which is uniform for all distribution functions $F$ of random variables with zero mean-value and unity variance. Moreover, a two-point distribution is found,…

概率论 · 数学 2007-10-19 V. I. Chebotarev , A. S. Kondrik , K. V. Mikhaylov

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…

信息论 · 计算机科学 2017-01-04 Günther Koliander , Georg Pichler , Erwin Riegler , Franz Hlawatsch

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.…

信息论 · 计算机科学 2022-07-26 John Çamkıran

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…

信息论 · 计算机科学 2015-10-20 Igal Sason , Sergio Verdu

We give the proof of a tight lower bound on the probability that a binomial random variable exceeds its expected value. The inequality plays an important role in a variety of contexts, including the analysis of relative deviation bounds in…

机器学习 · 计算机科学 2013-11-12 Spencer Greenberg , Mehryar Mohri

Entropy rate is a real valued functional on the space of discrete random sources which lacks a closed formula even for subclasses of sources which have intuitive parameterizations. A good way to overcome this problem is to examine its…

信息论 · 计算机科学 2015-01-14 Alexander Schönhuth

We establish a lower bound on the entropy of weighted sums of (possibly dependent) random variables $(X_1, X_2, \dots, X_n)$ possessing a symmetric joint distribution. Our lower bound is in terms of the joint entropy of $(X_1, X_2, \dots,…

信息论 · 计算机科学 2018-01-16 Jing Hao , Varun Jog

Given a bounded class of functions G and independent random variables X1, . . . , Xn, we provide an upper bound for the expectation of the supremum of the empirical process over elements of G having a small variance. Our bound applies in…

概率论 · 数学 2015-09-08 Yannick Baraud

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…

信息论 · 计算机科学 2017-05-01 Maciej Skorski

We consider families of finite quantum graphs of increasing size and we are interested in how eigenfunctions are distributed over the graph. As a measure for the distribution of an eigenfunction on a graph we introduce the entropy, it has…

数学物理 · 物理学 2014-05-23 Lionel Kameni , Roman Schubert
‹ 上一页 1 2 3 10 下一页 ›