user: text: Write a concise one-sentence TLDR summary of the scientific paper content below.

Title: The Convex Information Bottleneck Lagrangian

Paper content:
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 minimum level of compression r is achieved (i.e., I(X;T) <= r).
For practical reasons the problem is usually solved by maximizing the IB Lagrangian for many values of the Lagrange multiplier, therefore drawing the IB curve (i.e., the curve of maximal I(T;Y) for a given I(X;Y)) and selecting the representation of desired predictability and compression.
It is known when Y is a deterministic function of X, the IB curve cannot be explored and other Lagrangians have been proposed to tackle this problem (e.g., the squared IB Lagrangian).
In this paper we
(i) present a general family of Lagrangians which allow for the exploration of the IB curve in all scenarios;
(ii) prove that if these Lagrangians are used, there is a one-to-one mapping between the Lagrange multiplier and the desired compression rate r for known IB curve shapes, hence, freeing from the burden of solving the optimization problem for many values of the Lagrange multiplier.
Let X and Y be two statistically dependent random variables with joint distribution p(x, y).
The information bottleneck (IB) (Tishby et al., 2000) investigates the problem of extracting the relevant information from X for the task of predicting Y .
For this purpose, the IB defines a bottleneck variable T obeying the Markov chain Y ↔ X ↔ T so that T acts as a representation of X. Tishby et al. (2000) define the relevant information as the information the representation keeps from Y after the compression of X (i.e., I(T ; Y )), provided a minimum level of compression (i.e, I(X; T ) ≤ r).
Therefore, we select the representation which yields the value of the IB curve that best fits our requirements.
Definition 1 (IB functional).
Let X and Y be statistically dependent variables.
Let ∆ be the set of random variables T obeying the Markov condition Y ↔ X ↔ T .
Then the IB functional is F IB,max (r) = max T ∈∆ {I(T ; Y )} s.t. I(X; T ) ≤ r, ∀r ∈ [0, ∞).
(1)
Definition 2 (IB curve).
The IB curve is the set of points defined by the solutions of F IB,max (r) for varying values of r ∈ [0, ∞).
Definition 3 (Information plane).
The plane is defined by the axes I(T ; Y ) and I(X; T ).
In practice, solving a constrained optimization problem such as the IB functional is difficult.
Thus, in order to avoid the non-linear constraints from the IB functional the IB Lagrangian is defined.
Definition 4 (IB Lagrangian).
Let X and Y be statistically dependent variables.
Let ∆ be the set of random variables T obeying the Markov condition Y ↔ X ↔ T .
Then we define the IB Lagrangian as L β IB (T ) = I(T ; Y ) − βI(X; T ).
Here β ∈ [0, 1] is the Lagrange multiplier which controls the trade-off between the information of Y retained and the compression of X. Note we consider β ∈ [0, 1] because
(i) for β ≤ 0 many uncompressed solutions such as T = X maximizes L β IB , and
(ii) for β ≥ 1 the IB Lagrangian is non-positive due to the data processing inequality (DPI) (Theorem 2.8.1 from Cover & Thomas (2012) ) and trivial solutions like T = const are maximizers with L β IB = 0 (Kolchinsky et al., 2019) .
We know the solutions of the IB Lagrangian optimization (if existent) are solutions of the IB functional by the Lagrange's sufficiency theorem (Theorem 5 in Appendix A of Courcoubetis (2003) ).
Moreover, since the IB functional is concave (Lemma 5 of Gilad-Bachrach et al. (2003) ) we know they exist (Theorem 6 in Appendix A of Courcoubetis (2003) ).
Therefore, the problem is usually solved by maximizing the IB Lagrangian with adaptations of the Blahut-Arimoto algorithm (Tishby et al., 2000) , deterministic annealing approaches (Tishby & Slonim, 2001 ) or a bottom-up greedy agglomerative clustering (Slonim & Tishby, 2000) or its improved sequential counterpart (Slonim et al., 2002) .
However, when provided with high-dimensional random variables X such as images, these algorithms do not scale well and deep learning based techniques, where the IB Lagrangian is used as the objective function, prevailed (Alemi et al., 2017; Chalk et al., 2016; .
Note the IB Lagrangian optimization yields a representation T with a given performance (I(X; T ), I(T ; Y )) for a given β.
However there is no one-to-one mapping between β and I(X; T ).
Hence, we cannot directly optimize for a desired compression level r but we need to perform several optimizations for different values of β and select the representation with the desired performance (e.g., Alemi et al. (2017) ).
The Lagrange multiplier selection is important since
(i) sometimes even choices of β < 1 lead to trivial representations such that p T |X (t|x) = p T (t), and
(ii) there exist some discontinuities on the performance level w.r.t. the values of β (Wu et al., 2019).
Moreover, recently Kolchinsky et al. (2019) showed how in deterministic scenarios (such as many classification problems where an input x i belongs to a single particluar class y i ) the IB Lagrangian could not explore the IB curve.
Particularly, they showed that multiple β yielded the same performance level and that a single value of β could result in different performance levels.
To solve this issue, they introduced the squared IB Lagrangian, L βsq sq-IB = I(T ; Y ) − β sq I(X; T ) 2 , which is able to explore the IB curve in any scenario by optimizing for different values of β sq .
However, even though they realized a one-to-one mapping between β s q existed, they did not find such mapping.
Hence, multiple optimizations of the Lagrangian were still required to fing the best traded-off solution.
The main contributions of this article are:
1. We introduce a general family of Lagrangians (the convex IB Lagrangians) which are able to explore the IB curve in any scenario for which the squared IB Lagrangian (Kolchinsky et al., 2019 ) is a particular case of.
More importantly, the analysis made for deriving this family of Lagrangians can serve as inspiration for obtaining new Lagrangian families which solve other objective functions with intrinsic trade-off such as the IB Lagrangian.
2. We show that in deterministic scenarios (and other scenarios where the IB curve shape is known) one can use the convex IB Lagrangian to obtain a desired level of performance with a single optimization.
That is, there is a one-to-one mapping between the Lagrange multiplier used for the optmization and the level of compression and informativeness obtained, and we know such mapping.
Therefore, eliminating the need of multiple optimizations to select a suitable representation.
Furthermore, we provide some insight for explaining why there are discontinuities in the performance levels w.r.t. the values of the Lagrange multipliers.
In a classification setting, we connect those discontinuities with the intrinsic clusterization of the representations when optimizing the IB bottleneck objective.
The structure of the article is the following: in Section 2 we motivate the usage of the IB in supervised learning settings.
Then, in Section 3 we outline the important results used about the IB curve in deterministic scenarios.
Later, in Section 4 we introduce the convex IB Lagrangian and explain some of its properties.
After that, we support our (proved) claims with some empirical evidence on the MNIST dataset (LeCun et al., 1998) in Section 5.
The reader can download the PyTorch (Paszke et al., 2017) implementation at https://gofile.io/?c=G9Dl1L
.
The information bottleneck is a widely used and studied technique.
However, it is known that the IB Lagrangian cannot be used to achieve varying levels of performance in deterministic scenarios.
Moreover, in order to achieve a particular level of performance multiple optimizations with different Lagrange multipliers must be done to draw the IB curve and select the best traded-off representation.
In this article we introduced a general family of Lagrangians which allow to
(i) achieve varying levels of performance in any scenario, and
(ii) pinpoint a specific Lagrange multiplier β h to optimize for a specific performance level in known IB curve scenarios (e.g., deterministic).
Furthermore, we showed the β h domain when the IB curve is known and a β h domain bound for exploring the IB curve when it is unkown.
This way we can reduce and/or avoid multiple optimizations and, hence, reduce the computational effort for finding well traded-off representations.
Finally,
(iii) we provided some insight to the discontinuities on the performance levels w.r.t. the Lagange multipliers by connecting those with the intrinsic clusterization of the bottleneck variable.

assistant: text: We introduce a general family of Lagrangians that allow exploring the IB curve in all scenarios. When these are used, and the IB curve is known, one can optimize directly for a performance/compression level directly.