English
Related papers

Related papers: Minimum--Entropy Couplings and their Applications

200 papers

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

Given a collection of probability distributions $p_{1},\ldots,p_{m}$, the minimum entropy coupling is the coupling $X_{1},\ldots,X_{m}$ ($X_{i}\sim p_{i}$) with the smallest entropy $H(X_{1},\ldots,X_{m})$. While this problem is known to be…

Information Theory · Computer Science 2021-09-21 Cheuk Ting Li

Given probability distributions ${\bf p}=(p_1,p_2,\ldots,p_m)$ and ${\bf q}=(q_1,q_2,\ldots, q_n)$ with $m,n\geq 2$, denote by ${\cal C}(\bf p,q)$ the set of all couplings of $\bf p,q$, a convex subset of $\R^{mn}$. Denote by ${\cal…

Probability · Mathematics 2025-05-20 Ya-Jing Ma , Feng Wang , Xian-Yuan Wu , Kai-Yuan Cai

Given a set of discrete probability distributions, the minimum entropy coupling is the minimum entropy joint distribution that has the input distributions as its marginals. This has immediate relevance to tasks such as entropic causal…

Information Theory · Computer Science 2023-02-24 Spencer Compton , Dmitriy Katz , Benjamin Qi , Kristjan Greenewald , Murat Kocaoglu

In this paper, some general properties of Shannon information measures are investigated over sets of probability distributions with restricted marginals. Certain optimization problems associated with these functionals are shown to be…

Information Theory · Computer Science 2020-08-13 Mladen Kovačević , Ivan Stanojević , Vojin Šenk

This paper focuses on the extreme-value problem for Shannon entropy of the joint distribution with given marginals. It is proved that the minimum-entropy coupling must be of order-preserving, while the maximum-entropy coupling coincides…

Information Theory · Computer Science 2022-06-09 Ya-Jing Ma , Feng Wang , Xian-Yuan Wu , Kai-Yuan Cai

Given $m \ge 2$ discrete probability distributions over $n$ states each, the minimum-entropy coupling is the minimum-entropy joint distribution whose marginals are the same as the input distributions. Computing the minimum-entropy coupling…

Information Theory · Computer Science 2025-09-30 Spencer Compton

We study the problem of identifying the causal relationship between two discrete random variables from observational data. We recently proposed a novel framework called entropic causality that works in a very general functional model but…

Information Theory · Computer Science 2017-01-31 Murat Kocaoglu , Alexandros G. Dimakis , Sriram Vishwanath , Babak Hassibi

A coupling of two distributions $P_{X}$ and $P_{Y}$ is a joint distribution $P_{XY}$ with marginal distributions equal to $P_{X}$ and $P_{Y}$. Given marginals $P_{X}$ and $P_{Y}$ and a real-valued function $f$ of the joint distribution…

Information Theory · Computer Science 2021-08-24 Lei Yu , Vincent Y. F. Tan

Given a probability distribution ${\bf p} = (p_1, \dots, p_n)$ and an integer $1\leq m < n$, we say that ${\bf q} = (q_1, \dots, q_m)$ is a contiguous $m$-aggregation of ${\bf p}$ if there exist indices $0=i_0 < i_1 < \cdots < i_{m-1} < i_m…

Information Theory · Computer Science 2018-05-16 Ferdinando Cicalese , Ugo Vaccaro

Dependence among marginally constrained observations can break a finite-sample barrier. To formalize this phenomenon, we introduce the \emph{minimum list entropy coupling} $H(P\|Q_1,\dots,Q_m)$, the minimum conditional entropy…

Information Theory · Computer Science 2026-05-18 Shahab Asoodeh , Jun Chen

Maximum entropy models are increasingly being used to describe the collective activity of neural populations with measured mean neural activities and pairwise correlations, but the full space of probability distributions consistent with…

Biological Physics · Physics 2017-08-22 Badr F. Albanna , Christopher Hillar , Jascha Sohl-Dickstein , Michael R. DeWeese

A common statistical situation concerns inferring an unknown distribution Q(x) from a known distribution P(y), where X (dimension n), and Y (dimension m) have a known functional relationship. Most commonly, n<m, and the task is relatively…

Quantitative Methods · Quantitative Biology 2016-02-01 Jayajit Das , Sayak Mukherjee , Susan E. Hodge

In this paper we study the problem of computing max-entropy distributions over a discrete set of objects subject to observed marginals. Interest in such distributions arises due to their applicability in areas such as statistical physics,…

Data Structures and Algorithms · Computer Science 2013-05-02 Mohit Singh , Nisheeth K. Vishnoi

We examine the minimum entropy coupling problem, where one must find the minimum entropy variable that has a given set of distributions $S = \{p_1, \dots, p_m \}$ as its marginals. Although this problem is NP-Hard, previous works have…

Information Theory · Computer Science 2022-03-11 Spencer Compton

The problem of determining the joint probability distributions for correlated random variables with pre-specified marginals is considered. When the joint distribution satisfying all the required conditions is not unique, the "most unbiased"…

Statistical Mechanics · Physics 2015-06-12 Hernán Larralde

Given two jointly distributed random variables $(X,Y)$, a functional representation of $X$ is a random variable $Z$ independent of $Y$, and a deterministic function $g(\cdot, \cdot)$ such that $X=g(Y,Z)$. The problem of finding a minimum…

Information Theory · Computer Science 2023-05-11 Yanina Y. Shkel , Anuj Kumar Yadav

The mutual information (MI) between two random variables is an important correlation measure in data analysis. The Shannon entropy of a joint probability distribution is the variable part under fixed marginals. We aim to minimize and…

Optimization and Control · Mathematics 2025-09-08 Paula Franke , Kay Hamacher , Paul Manns

This paper addresses a fundamental problem in random variate generation: given access to a random source that emits a stream of independent fair bits, what is the most accurate and entropy-efficient algorithm for sampling from a discrete…

Data Structures and Algorithms · Computer Science 2020-03-10 Feras A. Saad , Cameron E. Freer , Martin C. Rinard , Vikash K. Mansinghka

We introduce the problem of \emph{entropy equivalence testing} for probability distributions, a relaxation of the well-studied closeness testing problem, where the distribution testing algorithm is now only required to distinguish, given…

Data Structures and Algorithms · Computer Science 2026-05-25 Clément L. Canonne , Yash Pote , Jonathan Scarlett , Joy Qiping Yang
‹ Prev 1 2 3 10 Next ›