English
Related papers

Related papers: Thinning and Information Projections

200 papers

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…

Machine Learning · Computer Science 2013-11-12 Spencer Greenberg , Mehryar Mohri

In this paper, we establish a new law of large numbers with the rate of convergence for special partial sums in a probability space. The proof relies on nonlinear expectation theory, as the uncertainty of random variables in the special…

Information Theory · Computer Science 2026-03-25 Jialiang Fu , Wen-Xuan Lang

We adapt arguments concerning information-theoretic convergence in the Central Limit Theorem to the case of dependent random variables under Rosenblatt mixing conditions. The key is to work with random variables perturbed by the addition of…

Probability · Mathematics 2008-10-06 Oliver Johnson

We derive information-theoretic converses (i.e., lower bounds) for the minimum time required by any algorithm for distributed function computation over a network of point-to-point channels with finite capacity, where each node of the…

Information Theory · Computer Science 2017-01-04 Aolin Xu , Maxim Raginsky

One aspect of Poisson approximation is that the support of the random variable of interest is often finite while the support of the Poisson distribution is not. In this paper we will remedy this by examining truncated negative binomial (of…

Probability · Mathematics 2017-05-02 H. L. Gan

We describe five types of results concerning information and concentration of discrete random variables, and relationships between them, motivated by their counterparts in the continuous case. The results we consider are information…

Probability · Mathematics 2017-04-25 Oliver Johnson

We provide a general result for bounding the difference between point probabilities of integer supported distributions and the translated Poisson distribution, a convenient alternative to the discretized normal. We illustrate our theorem in…

Probability · Mathematics 2017-12-05 A. D. Barbour , Adrian Röllin , Nathan Ross

We review the methods of constructing confidence intervals that account for a priori information about one-sided constraints on the parameter being estimated. We show that the so-called method of sensitivity limit yields a correct solution…

Data Analysis, Statistics and Probability · Physics 2015-05-20 A. V. Lokhov , F. V. Tkachov

We present a new method to propagate lower bounds on conditional probability distributions in conventional Bayesian networks. Our method guarantees to provide outer approximations of the exact lower bounds. A key advantage is that we can…

Artificial Intelligence · Computer Science 2012-05-14 Daniel Andrade , Bernhard Sick

Tight bounds for several symmetric divergence measures are introduced, given in terms of the total variation distance. Each of these bounds is attained by a pair of 2 or 3-element probability distributions. An application of these bounds…

Information Theory · Computer Science 2016-11-15 Igal Sason

Consider the family of power divergence statistics based on $n$ trials, each leading to one of $r$ possible outcomes. This includes the log-likelihood ratio and Pearson's statistic as important special cases. It is known that in certain…

Probability · Mathematics 2024-11-08 Fraser Daly

Tight bounds for several symmetric divergence measures are derived in terms of the total variation distance. It is shown that each of these bounds is attained by a pair of 2 or 3-element probability distributions. An application of these…

Information Theory · Computer Science 2016-11-17 Igal Sason

Machine learning models have traditionally been developed under the assumption that the training and test distributions match exactly. However, recent success in few-shot learning and related problems are encouraging signs that these models…

Machine Learning · Statistics 2020-10-15 James Lucas , Mengye Ren , Irene Kameni , Toniann Pitassi , Richard Zemel

It is proved, that for a certain kind of input distribution, the strongly binomially attenuated photon number distribution can well be approximated by a Poisson distribution. This explains why we can adopt poissonian distribution as the…

Mathematical Physics · Physics 2009-11-11 Yucheng Hu , Xiang Peng , Tiejun Li , Hong Guo

In this paper a numerical method is presented, which finds a lower bound for the mutual information between a binary and an arbitrary finite random variable with joint distributions that have a variational distance not greater than a known…

Information Theory · Computer Science 2013-01-29 A. G. Stefani , J. B. Huber , C. Jardin , H. Sticht

We derive lower bounds on the Bayes risk in decentralized estimation, where the estimator does not have direct access to the random samples generated conditionally on the random parameter of interest, but only to the data received from…

Information Theory · Computer Science 2016-07-05 Aolin Xu , Maxim Raginsky

This article studies the weak convergence and associated Central Limit Theorem for blurring and nonblurring processes. Then, they are applied to the estimation of location parameter. Simulation studies show that the location estimation…

Statistics Theory · Mathematics 2015-01-28 Ting-Li Chen , Hironori Fujisawa , Su-Yun Huang , Chii-Ruey Hwang

A simple method is shown to provide optimal variational bounds on $f$-divergences with possible constraints on relative information extremums. Known results are refined or proved to be optimal as particular cases.

Information Theory · Computer Science 2019-02-05 Olivier Binette

In this article, we obtain, for the total variance distance, the error bounds between Poisson and convolution of power series distributions via Stein's method. This provides a unified approach to many known discrete distributions. Several…

Probability · Mathematics 2020-06-26 A. N. Kumar , P. Vellaisamy , F. Viens

We present an information-theoretic lower bound for the problem of parameter estimation with time-uniform coverage guarantees. Via a new a reduction to sequential testing, we obtain stronger lower bounds that capture the hardness of the…

Information Theory · Computer Science 2024-06-13 John C. Duchi , Saminul Haque