English
Related papers

Related papers: Bayesian Error Based Sequences of Mutual Informati…

200 papers

Recent advances in statistical learning theory have revealed profound connections between mutual information (MI) bounds, PAC-Bayesian theory, and Bayesian nonparametrics. This work introduces a novel mutual information bound for…

Machine Learning · Statistics 2025-08-18 El Mahdi Khribch , Pierre Alquier

Two alternative exact characterizations of the minimum error probability of Bayesian M-ary hypothesis testing are derived. The first expression corresponds to the error probability of an induced binary hypothesis test and implies the…

Information Theory · Computer Science 2016-04-07 Gonzalo Vazquez-Vilar , Adrià Tauste Campo , Albert Guillén i Fàbregas , Alfonso Martinez

I present several new relations between mutual information (MI) and statistical estimation error for a system that can be regarded simultaneously as a communication channel and as an estimator of an input parameter. I first derive a…

Applications · Statistics 2010-10-08 Sudhakar Prasad

We consider the problem of estimating the probability of error in multi-hypothesis testing when MAP criterion is used. This probability, which is also known as the Bayes risk is an important measure in many communication and information…

Information Theory · Computer Science 2007-07-16 Nandakishore Santhi , Alexander Vardy

We derive a tight lower bound on equivocation (conditional entropy), or equivalently a tight upper bound on mutual information between a signal variable and channel outputs. The bound is in terms of the joint distribution of the signals and…

Information Theory · Computer Science 2019-01-14 Michal Hledík , Thomas R. Sokolowski , Gašper Tkačik

We derive a general upper bound to mutual information in terms of the Fisher information. The bound may be further used to derive a lower bound for the Bayesian quadratic cost. These two provide alternatives to other inequalities in the…

Quantum Physics · Physics 2025-05-16 Wojciech Górecki , Xi Lu , Chiara Macchiavello , Lorenzo Maccone

A lower bound on the minimum mean-squared error (MSE) in a Bayesian estimation problem is proposed in this paper. This bound utilizes a well-known connection to the deterministic estimation setting. Using the prior distribution, the bias…

Information Theory · Computer Science 2009-05-27 Zvika Ben-Haim , Yonina C. Eldar

We correct claims about lower bounds on mutual information (MI) between real-valued random variables made in A. Kraskov {\it et al.}, Phys. Rev. E {\bf 69}, 066138 (2004). We show that non-trivial lower bounds on MI in terms of linear…

Data Analysis, Statistics and Probability · Physics 2013-05-29 David V. Foster , Peter Grassberger

An information-theoretic upper bound on the generalization error of supervised learning algorithms is derived. The bound is constructed in terms of the mutual information between each individual training sample and the output of the…

Machine Learning · Computer Science 2020-08-06 Yuheng Bu , Shaofeng Zou , Venugopal V. Veeravalli

This paper provides a general technique for lower bounding the Bayes risk of statistical estimation, applicable to arbitrary loss functions and arbitrary prior distributions. A lower bound on the Bayes risk not only serves as a lower bound…

Statistics Theory · Mathematics 2016-12-26 Xi Chen , Adityanand Guntuboyina , Yuchen Zhang

The existing upper and lower bounds between entropy and error are mostly derived through an inequality means without linking to joint distributions. In fact, from either theoretical or application viewpoint, there exists a need to achieve a…

Information Theory · Computer Science 2013-03-06 Bao-Gang Hu , Hong-Jie Xing

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

The mutual information between two jointly distributed random variables $X$ and $Y$ is a functional of the joint distribution $P_{XY},$ which is sometimes difficult to handle or estimate. A coarser description of the statistical behavior of…

Information Theory · Computer Science 2016-11-17 Yanjun Han , Or Ordentlich , Ofer Shayevitz

The existing upper and lower bounds between entropy and error probability are mostly derived from the inequality of the entropy relations, which could introduce approximations into the analysis. We derive analytical bounds based on the…

Information Theory · Computer Science 2012-05-31 Bao-Gang Hu , Hong-Jie Xing

We consider the problem of parameter estimation in a Bayesian setting and propose a general lower-bound that includes part of the family of $f$-Divergences. The results are then applied to specific settings of interest and compared to other…

Information Theory · Computer Science 2022-05-19 Adrien Vandenbroucque , Amedeo Roberto Esposito , Michael Gastpar

Pimentel et al. (2020) recently analysed probing from an information-theoretic perspective. They argue that probing should be seen as approximating a mutual information. This led to the rather unintuitive conclusion that representations…

Computation and Language · Computer Science 2021-09-10 Tiago Pimentel , Ryan Cotterell

The design of informatively rich input signals is essential for accurate system identification, yet classical Fisher-information-based methods are inherently local and often inadequate in the presence of significant model uncertainty and…

Statistics Theory · Mathematics 2025-12-15 Piotr Bania , Anna Wójcik

Detailed derivations of two bounds of the minimum mean-square error (MMSE) of complex-valued multiple-input multiple-output (MIMO) systems are proposed for performance evaluation. Particularly, the lower bound is derived based on a…

Information Theory · Computer Science 2021-11-29 Chongjun Ouyang , Hongwen Yang

We consider the estimation of a signal from the knowledge of its noisy linear random Gaussian projections, a problem relevant in compressed sensing, sparse superposition codes or code division multiple access just to cite few. There has…

Information Theory · Computer Science 2017-03-24 Jean Barbier , Mohamad Dia , Nicolas Macris , Florent Krzakala

The Bayesian posterior minimizes the "inferential risk" which itself bounds the "predictive risk". This bound is tight when the likelihood and prior are well-specified. However since misspecification induces a gap, the Bayesian posterior…

Machine Learning · Computer Science 2022-05-24 Warren R. Morningstar , Alexander A. Alemi , Joshua V. Dillon
‹ Prev 1 2 3 10 Next ›