arXiv (All)
open access
On the Cardinality of Optimal Representations in the Binary-Source Information Bottleneck
The information bottleneck (IB) seeks a representation $U$ of a source $X$ that retains as much information as possible about a target $Y$, subject to a constraint on $I(U;X)$. A classical argument shows that it suffices to consider representations with at most $|\mathcal{X}|+1$ symbols, and this bo
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- On the Cardinality of Optimal Representations in the Binary-Source Information Bottleneck#1194457
- The Information Bottleneck is NP-hard#1357927
- Quantifying Stabilization: A Minimal Information-Theoretic Framework for Representation Robustness under Transformations#104937
- Ramsey Obstructions to Disambiguation#1110722
- Optimal representations and the Enhanced Indispensability Argument#698239
Record · ID 1215722
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive