English
Related papers

Related papers: Bounds on Variance for Unimodal Distributions

200 papers

The paper search for the minimum of the entropy of a two- dimensional distribution in the Fr\'echet class, the class of distributions with given marginals. The main result for discrete distributions is an algorithm for building the…

Statistics Theory · Mathematics 2016-11-25 Giorgio Dall'Aglio , Elisabetta Bona

This paper considers the estimation of Shannon entropy for discrete distributions with countably infinite support. While minimax rates for finite-support distributions are established, infinite-support distributions present distinct…

Statistics Theory · Mathematics 2025-12-03 Octavio César Mesner

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…

Information Theory · Computer Science 2019-05-09 Ehsan Nekouei , Mikael Skoglund , Karl Henrik Johansson

This paper gives upper and lower bounds on the gap in Jensen's inequality, i.e., the difference between the expected value of a function of a random variable and the value of the function at the expected value of the random variable. The…

Probability · Mathematics 2020-08-21 Xiang Gao , Meera Sitharam , Adrian E. Roitberg

Uniform deviation bounds limit the difference between a model's expected loss and its loss on an empirical sample uniformly for all models in a learning problem. As such, they are a critical component to empirical risk minimization. In this…

Machine Learning · Statistics 2017-02-28 Olivier Bachem , Mario Lucic , S. Hamed Hassani , Andreas Krause

We present some new and explicit error bounds for the approximation of distributions. The approximation error is quantified by the maximal density ratio of the distribution $Q$ to be approximated and its proxy $P$. This non-symmetric…

Statistics Theory · Mathematics 2022-09-02 Lutz Duembgen , Richard Samworth , Jon Wellner

Variance reduction is a family of powerful mechanisms for stochastic optimization that appears to be helpful in many machine learning tasks. It is based on estimating the exact gradient with some recursive sequences. Previously, many papers…

Optimization and Control · Mathematics 2025-11-07 Aleksandr Shestakov , Valery Parfenov , Aleksandr Beznosikov

A method for estimating the Shannon differential entropy of multidimensional random variables using independent samples is described. The method is based on decomposing the distribution into a product of the marginal distributions and the…

Statistical Mechanics · Physics 2020-04-22 Gil Ariel , Yoram Louzoun

We establish the unimodality and the asymptotic strong unimodality of the ordinary multinomials and give their smallest mode leading to the expression of the maximal probability of convolution powers of the discrete uniform distribution. We…

Probability · Mathematics 2007-08-20 Hacene Belbachir

Given an intractable distribution $p$, the problem of variational inference (VI) is to find the best approximation from some more tractable family $Q$. Commonly, one chooses $Q$ to be a family of factorized distributions (i.e., the…

Machine Learning · Statistics 2025-10-21 Charles C. Margossian , Loucas Pillaud-Vivien , Lawrence K. Saul

This paper explores some applications of a two-moment inequality for the integral of the $r$-th power of a function, where $0 < r< 1$. The first contribution is an upper bound on the R\'{e}nyi entropy of a random vector in terms of the two…

Information Theory · Computer Science 2017-02-24 Galen Reeves

We provide a sharp lower bound on the $p$-norm of a sum of independent uniform random variables in terms of its variance when $0 < p < 1$. We address an analogous question for $p$-R\'enyi entropy for $p$ in the same range.

Probability · Mathematics 2025-01-28 Giorgos Chasapis , Keerthana Gurushankar , Tomasz Tkocz

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$,…

Discrete Mathematics · Computer Science 2022-04-05 Dmytro Gavinsky , Pavel Pudlák

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…

Combinatorics · Mathematics 2026-04-30 Lampros Gavalakis , Marcel K. Goh , Ioannis Kontoyiannis

In this paper, we focus on the separability of classes with the cross-entropy loss function for classification problems by theoretically analyzing the intra-class distance and inter-class distance (i.e. the distance between any two points…

Machine Learning · Computer Science 2019-09-17 Rudrajit Das , Subhasis Chaudhuri

New upper bounds on the relative entropy are derived as a function of the total variation distance. One bound refines an inequality by Verd\'{u} for general probability measures. A second bound improves the tightness of an inequality by…

Information Theory · Computer Science 2015-04-14 Igal Sason

This paper serves a twofold purpose. First, a unified perspective on diversity indices is introduced based on an entropic basis. It is shown that the class of all linear combinations of the entropic basis, referred to as the class of linear…

Statistics Theory · Mathematics 2020-01-22 Zhiyi Zhang , Michael Grabchak

The aim of this paper is to discuss new results concerning some kinds of parametric extended entropies and divergences. As a result of our studies for mathematical properties on entropy and divergence, we give new bounds for the Tsallis…

Information Theory · Computer Science 2019-07-24 Shigeru Furuichi , Nicuşor Minculete

We consider shift spaces in which elements of the alphabet may overlap nontransitively. We define a notion of entropy for such spaces, give several techniques for computing lower bounds for it, and show that it is equal to a limit of…

Dynamical Systems · Mathematics 2010-11-16 Fabio Drucker , David Richeson , Jim Wiseman

The minimum rate needed to accurately approximate a product distribution based on an unnormalized informational divergence is shown to be a mutual information. This result subsumes results of Wyner on common information and Han-Verd\'{u} on…

Information Theory · Computer Science 2013-05-14 Jie Hou , Gerhard Kramer
‹ Prev 1 3 4 5 6 7 10 Next ›