On the Cardinality of Optimal Representations in the Binary-Source Information Bottleneck

cs.IT, cs.LG, math.IT, math.OC

Submitted: 2026-10-05

Updated: 2026-10-05

Comments: 9 pages. Feedback and comments are welcome!

License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/

Sources

• Opening the Black Box of Deep Neural Networks via Information
• Mutual Information Constrained Chernoff Bottleneck

Related papers

• Language Modeling is Monotone Compression
• Clipped Affine Policy: Low-Complexity Near-Optimal Online Power Control for Energy Harvesting Communications over Fading Channels
• Discrepancy for Random Linear Codes
• A New Approach to Code Smoothing Bounds
• Contextual Memory-Enhanced Source Coding for Low-SNR Communications
• Symmetry-Enforced Quadratic Approximate-Degradability Bounds for Noisy Landau-Streater Channels