Minimum list entropy coupling shows dependent observations can achieve zero residual entropy with O(log(1/P_min)) samples under mild support assumptions, with applications to exact recovery in representation learning and randomness extraction.
Information spectrum converse for minimum entropy couplings and functional representations
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.IT 2years
2026 2verdicts
UNVERDICTED 2roles
background 1polarities
background 1representative citing papers
Rényi entropy is subadditive on the majorization lattice for every α ∈ [0,∞] and supermodular for α ∈ {0} ∪ [1,∞]; Tsallis entropy is subadditive and supermodular for all α ∈ [0,∞).
citing papers explorer
-
Breaking the Finite-Sample Barrier in Entropy Coupling
Minimum list entropy coupling shows dependent observations can achieve zero residual entropy with O(log(1/P_min)) samples under mild support assumptions, with applications to exact recovery in representation learning and randomness extraction.
-
Geometry of R\'enyi Entropy on the Majorization Lattice
Rényi entropy is subadditive on the majorization lattice for every α ∈ [0,∞] and supermodular for α ∈ {0} ∪ [1,∞]; Tsallis entropy is subadditive and supermodular for all α ∈ [0,∞).