Minimum-entropy coupling approximation guarantees beyond the majorization barrier
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 …
minimum entropy joint distribution that has the input distributions as its marginals. This has …
Channel Simulation: Theory and Applications to Lossy Compression and Differential Privacy
CT Li - Foundations and Trends® in Communications and …, 2024 - nowpublishers.com
One-shot channel simulation (or channel synthesis) has seen increasing applications in
lossy compression, differential privacy and machine learning. In this setting, an encoder …
lossy compression, differential privacy and machine learning. In this setting, an encoder …
A Test Case Generation Scheduling Model Based on Running Event Interval Characteristics
Y Li, T Qin, J Zou, H Li, CB Yan… - IEEE Transactions on …, 2024 - ieeexplore.ieee.org
System testing mainly focuses on finding bugs before online deployment. However, the
system's complexity increases due to a surge in the number of users, which makes …
system's complexity increases due to a surge in the number of users, which makes …
A decomposition-based improved broad learning system model for short-term load forecasting
It is still a challenging problem for most existing forecasting methods to obtain accurate and
rapid prediction performance in short-term load forecasting because of the complexity and …
rapid prediction performance in short-term load forecasting because of the complexity and …
A tighter approximation guarantee for greedy minimum entropy coupling
S Compton - 2022 IEEE International Symposium on …, 2022 - ieeexplore.ieee.org
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,…, pm} as its marginals …
entropy variable that has a given set of distributions S={p 1,…, pm} as its marginals …
Information spectrum converse for minimum entropy couplings and functional representations
Given two jointly distributed random variables \left(X,Y\right), a functional representation of X
is a random variable Z independent of Y, and a deterministic function g\left(⋅,⋅\right) such …
is a random variable Z independent of Y, and a deterministic function g\left(⋅,⋅\right) such …
Computing Low-Entropy Couplings for Large-Support Distributions
Minimum-entropy coupling (MEC)--the process of finding a joint distribution with minimum
entropy for given marginals--has applications in areas such as causality and steganography …
entropy for given marginals--has applications in areas such as causality and steganography …
[HTML][HTML] Hardness and Approximability of Dimension Reduction on the Probability Simplex
R Bruno - Algorithms, 2024 - mdpi.com
Dimension reduction is a technique used to transform data from a high-dimensional space
into a lower-dimensional space, aiming to retain as much of the original information as …
into a lower-dimensional space, aiming to retain as much of the original information as …
Infinite divisibility of information
CT Li - IEEE Transactions on Information Theory, 2022 - ieeexplore.ieee.org
We study an information analogue of infinitely divisible probability distributions, where the iid
sum is replaced by the joint distribution of an iid sequence. A random variable is called …
sum is replaced by the joint distribution of an iid sequence. A random variable is called …
A note on equivalent conditions for majorization
In this paper, we introduce novel characterizations of the classical concept of majorization in
terms of upper triangular (resp., lower triangular) row-stochastic matrices, and in terms of …
terms of upper triangular (resp., lower triangular) row-stochastic matrices, and in terms of …