# The Convex Information Bottleneck Lagrangian

25 Nov 2019Borja Rodríguez GálvezRagnar ThobabenMikael Skoglund

The information bottleneck (IB) problem tackles the issue of obtaining relevant compressed representations $T$ of some random variable $X$ for the task of predicting $Y$. It is defined as a constrained optimization problem which maximizes the information the representation has about the task, $I(T;Y)$, while ensuring that a certain level of compression $r$ is achieved (i.e., $I(X;T) \leq r$)... (read more)

PDF Abstract