English
Related papers

Related papers: Entropic Inequalities and Marginal Problems

200 papers

Shearer's inequality bounds the sum of joint entropies of random variables in terms of the total joint entropy. We give another lower bound for the same sum in terms of the individual entropies when the variables are functions of…

Probability · Mathematics 2021-03-23 Endre Csóka , Viktor Harangi , Bálint Virág

The ability to estimate joint, conditional and marginal probability distributions over some set of variables is of great utility for many common machine learning tasks. However, estimating these distributions can be challenging,…

Machine Learning · Computer Science 2018-09-20 Andrew Skabar

Given two discrete random variables $X$ and $Y$, with probability distributions ${\bf p} =(p_1, \ldots , p_n)$ and ${\bf q}=(q_1, \ldots , q_m)$, respectively, denote by ${\cal C}({\bf p}, {\bf q})$ the set of all couplings of ${\bf p}$ and…

Information Theory · Computer Science 2017-03-29 Ferdinando Cicalese , Luisa Gargano , Ugo Vaccaro

For any Bell locality scenario (or Kochen-Specker noncontextuality scenario), the joint Shannon entropies of local (or noncontextual) models define a convex cone for which the non-trivial facets are tight entropic Bell (or contextuality)…

Quantum Physics · Physics 2012-03-15 Rafael Chaves , Tobias Fritz

Mixture distributions are extensively used as a modeling tool in diverse areas from machine learning to communications engineering to physics, and obtaining bounds on the entropy of probability distributions is of fundamental importance in…

Information Theory · Computer Science 2022-12-05 James Melbourne , Saurav Talukdar , Shreyas Bhaban , Mokshay Madiman , Murti V. Salapaka

We propose a family of "exactly solvable" probability distributions to approximate partition functions of two-dimensional statistical mechanics models. While these distributions lie strictly outside the mean-field framework, their free…

Statistical Mechanics · Physics 2021-06-09 Isaac H. Kim

Consider the triplet $(E, \mathcal{P}, \pi)$, where $E$ is a finite ground set, $\mathcal{P} \subseteq 2^E$ is a collection of subsets of $E$ and $\pi : \mathcal{P} \rightarrow [0,1]$ is a requirement function. Given a vector of marginals…

Discrete Mathematics · Computer Science 2023-11-10 Jannik Matuschke

The maximum entropy principle (MEP) is a method for obtaining the most likely distribution functions of observables from statistical systems, by maximizing entropy under constraints. The MEP has found hundreds of applications in ergodic and…

Classical Physics · Physics 2016-10-03 Rudolf Hanel , Stefan Thurner , Murray Gell-Mann

Given two discrete random variables $X$ and $Y,$ with probability distributions ${\bf p}=(p_1, \ldots , p_n)$ and ${\bf q}=(q_1, \ldots , q_m)$, respectively, denote by ${\cal C}({\bf p}, {\bf q})$ the set of all couplings of ${\bf p}$ and…

Information Theory · Computer Science 2019-01-24 Ferdinando Cicalese , Luisa Gargano , Ugo Vaccaro

We investigate the use of a certain class of functional inequalities known as weak Poincar\'e inequalities to bound convergence of Markov chains to equilibrium. We show that this enables the straightforward and transparent derivation of…

Computation · Statistics 2024-09-25 Christophe Andrieu , Anthony Lee , Sam Power , Andi Q. Wang

Shannon entropy, a cornerstone of information theory, statistical physics and inference methods, is uniquely identified by the Shannon-Khinchin or Shore-Johnson axioms. Generalizations of Shannon entropy, motivated by the study of…

Data Analysis, Statistics and Probability · Physics 2026-04-20 Andrea Somazzi , Diego Garlaschelli

We study conditional linear information inequalities, i.e., linear inequalities for Shannon entropy that hold for distributions whose entropies meet some linear constraints. We prove that some conditional information inequalities cannot be…

Information Theory · Computer Science 2013-10-30 Tarik Kaced , Andrei Romashchenko

Even if a probability distribution is properly normalizable, its associated Shannon (or von Neumann) entropy can easily be infinite. We carefully analyze conditions under which this phenomenon can occur. Roughly speaking, this happens when…

Statistical Mechanics · Physics 2013-04-04 Valentina Baccetti , Matt Visser

Shannon Entropy is the preeminent tool for measuring the level of uncertainty (and conversely, information content) in a random variable. In the field of communications, entropy can be used to express the information content of given…

Information Theory · Computer Science 2024-11-06 Bill Kay , Audun Myers , Thad Boydston , Emily Ellwein , Cameron Mackenzie , Iliana Alvarez , Erik Lentz

The quantum marginal problem asks, given a set of reduced quantum states of a multipartite system, whether there exists a joint quantum state consistent with these reduced states. The quantum marginal problem is known to be hard to solve in…

Quantum Physics · Physics 2008-06-19 Tobias J. Osborne

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

Shannon entropy for discrete distributions is a fundamental and widely used concept, but its continuous analogue, known as differential entropy, lacks essential properties such as positivity and compatibility with the discrete case. In this…

Probability · Mathematics 2025-08-07 Yuliya Mishura , Kostiantyn Ralchenko

Given a set of several inputs into a system (e.g., independent variables characterizing stimuli) and a set of several stochastically non-independent outputs (e.g., random variables describing different aspects of responses), how can one…

Artificial Intelligence · Computer Science 2011-08-30 Ehtibar N. Dzhafarov , Janne V. Kujala

Maximum entropy distributions with discrete support in $m$ dimensions arise in machine learning, statistics, information theory, and theoretical computer science. While structural and computational properties of max-entropy distributions…

Data Structures and Algorithms · Computer Science 2019-06-04 Damian Straszak , Nisheeth K. Vishnoi

Ranks of subspaces of vector spaces satisfy all linear inequalities satisfied by entropies (including the standard Shannon inequalities) and an additional inequality due to Ingleton. It is known that the Shannon and Ingleton inequalities…

Information Theory · Computer Science 2010-07-21 Randall Dougherty , Chris Freiling , Kenneth Zeger