English
Related papers

Related papers: Bounds on Variance for Unimodal Distributions

200 papers

Importance weighted variational inference (Burda et al., 2015) uses multiple i.i.d. samples to have a tighter variational lower bound. We believe a joint proposal has the potential of reducing the number of redundant samples, and introduce…

Machine Learning · Computer Science 2019-05-14 Chin-Wei Huang , Kris Sankaran , Eeshan Dhekane , Alexandre Lacoste , Aaron Courville

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

Differential balancing theory for nonlinear model reduction relies on differential controllability and observability functions. In this paper, we further investigate them from two different perspectives. First, we establish novel…

Systems and Control · Electrical Eng. & Systems 2025-04-07 Yu Kawano , Bart Besselink , Jacquelien M. A. Scherpen

Characterising the capacity region for a network can be extremely difficult. Even with independent sources, determining the capacity region can be as hard as the open problem of characterising all information inequalities. The majority of…

Information Theory · Computer Science 2016-07-12 Satyajit Thakor , Terence Chan , Alex Grant

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…

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

Probability distributions produced by the cross-entropy loss for ordinal classification problems can possess undesired properties. We propose a straightforward technique to constrain discrete ordinal probability distributions to be unimodal…

Machine Learning · Statistics 2017-06-23 Christopher Beckham , Christopher Pal

We establish upper and lower bounds for the metric entropy and bracketing entropy of the class of $d$-dimensional bounded monotonic functions under $L^p$ norms. It is interesting to see that both the metric entropy and bracketing entropy…

Statistics Theory · Mathematics 2007-06-13 Fuchang Gao , Jon A. Wellner

A general upper bound for topological entropy of switched nonlinear systems is constructed, using an asymptotic average of upper limits of the matrix measures of Jacobian matrices of strongly persistent individual modes, weighted by their…

Systems and Control · Electrical Eng. & Systems 2023-01-31 Guosong Yang , Daniel Liberzon , João P. Hespanha

We establish a connection between barcode entropy and metric entropy. Namely, we show that the barcode entropy bounds the metric entropy from below for a measure from a specific class of invariant measures associated with a pair of…

Symplectic Geometry · Mathematics 2025-07-18 Erman Cineli , Viktor L. Ginzburg , Basak Z. Gurel

We study the continuity property of the generalized entropy as a function of the underlying probability distribution, defined with an action space and a loss function, and use this property to answer the basic questions in statistical…

Machine Learning · Computer Science 2022-01-04 Aolin Xu

Entropy is a measure of heterogeneity widely used in applied sciences, often when data are collected over space. Recently, a number of approaches has been proposed to include spatial information in entropy. The aim of entropy is to…

Statistics Theory · Mathematics 2019-11-12 Linda Altieri , Daniela Cocchi , Giulia Roli

Several implications of well-known fluctuation theorems, on the statistical properties of the entropy production, are studied using various approaches. We begin by deriving a tight lower bound on the variance of the entropy production for a…

Statistical Mechanics · Physics 2015-05-20 Neri Merhav , Yariv Kafri

When factorized approximations are used for variational inference (VI), they tend to underestimate the uncertainty -- as measured in various ways -- of the distributions they are meant to approximate. We consider two popular ways to measure…

Machine Learning · Statistics 2023-05-29 Charles C. Margossian , Lawrence K. Saul

We consider distributions of ordered random vectors with given one-dimensional marginal distributions. We give an elementary necessary and sufficient condition for the existence of such a distribution with finite entropy. In this case, we…

Statistics Theory · Mathematics 2015-09-08 Cristina Butucea , Jean-François Delmas , Anne Dutfoy , Richard Fischer

This paper studies the complexity of estimating Renyi divergences of discrete distributions: $p$ observed from samples and the baseline distribution $q$ known \emph{a priori}. Extending the results of Acharya et al. (SODA'15) on estimating…

Information Theory · Computer Science 2017-02-09 Maciej Skorski

The most common way to sample from a probability distribution is to use Monte-Carlo methods. For distributions on a continuous state space, one can find diffusions with the target distribution as equilibrium measure, so that the state of…

Probability · Mathematics 2015-10-28 Chii-Ruey Hwang , Raoul Normand , Sheng-Jhih Wu

Computing the similarity between two probability distributions is a recurring theme across control. We introduce a unified family of distances between the probability distributions of two random variables that is based on the discrepancy…

Systems and Control · Electrical Eng. & Systems 2025-10-03 Alexandros E. Tzikas , Arec Jamgochian , Nazim Kemal Ure , Mykel J. Kochenderfer , Stephen P. Boyd

We provide finite-sample distribution approximations, that are uniform in the parameter, for inference in linear mixed models. Focus is on variances and covariances of random effects in cases where existing theory fails because their…

Statistics Theory · Mathematics 2025-07-29 Karl Oskar Ekvall , Matteo Bottai

New families of Fisher information and entropy power inequalities for sums of independent random variables are presented. These inequalities relate the information in the sum of $n$ independent random variables to the information contained…

Information Theory · Computer Science 2024-05-07 Mokshay Madiman , Andrew Barron

Two-sided bounds are explored for concentration functions and R\'enyi entropies in the class of discrete log-concave probability distributions. They are used to derive certain variants of the entropy power inequalities.

Probability · Mathematics 2021-04-27 Sergey G. Bobkov , Arnaud Marsiglietti , James Melbourne