arXiv (All)
open access
The Information Bottleneck is NP-hard
Given a joint distribution $P_{XY}$ on a finite alphabet, the information bottleneck method seeks a representation $T$ of $X$ that is as informative as possible about $Y$ while compressing $X$, where $T$ and $Y$ are conditionally independent given $X$. We show that computing the optimal value $\math
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#1215722
- On the Cardinality of Optimal Representations in the Binary-Source Information Bottleneck#1194457
- Efficient and rate-optimal list-decoding in the presence of minimal feedback#1076767
- Optimal Networks for Agentic Information Aggregation#1130118
- Optimal Networks for Agentic Information Aggregation#1108783
Record · ID 1357927
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