We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
The Information Bottleneck (IB) framework is a general characterization of optimal representations obtained using a principled approach for balancing accuracy and complexity. Here we present a new framework, the Dual Information Bottleneck (dualIB), which resolves some of the known drawbacks of the IB. We provide a theoretical analysis of the dualIB framework; (i) solving for the structure of its solutions (ii) unraveling its superiority in optimizing the mean prediction error exponent and (iii) demonstrating its ability to preserve exponential forms of the original distribution. To approach large scale problems, we present a novel variational formulation of the dualIB for Deep Neural Networks. In experiments on several data-sets, we compare it to a variational form of the IB. This exposes superior Information Plane properties of the dualIB and its potential in improvement of the error.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2006.04641")
get_code_for_paper("2006.04641")
have("2006.04641")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2006.04641.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2006.04641)
Connect an agent — have() is free.