The Variational Deficiency Bottleneck

10/27/2018
by   Pradeep Kr. Banerjee, et al.
0

We introduce a bottleneck method for learning data representations based on channel deficiency, rather than the more traditional information sufficiency. A variational upper bound allows us to implement this method efficiently. The bound itself is bounded above by the variational information bottleneck objective, and the two methods coincide in the regime of single-shot Monte Carlo approximations. The notion of deficiency provides a principled way of approximating complicated channels by relatively simpler ones. The deficiency of one channel w.r.t. another has an operational interpretation in terms of the optimal risk gap of decision problems, capturing classification as a special case. Unsupervised generalizations are possible, such as the deficiency autoencoder, which can also be formulated in a variational form. Experiments demonstrate that the deficiency bottleneck can provide advantages in terms of minimal sufficiency as measured by information bottleneck curves, while retaining a good test performance in classification and reconstruction tasks.

READ FULL TEXT
research
03/07/2020

The Variational InfoMax Learning Objective

Bayesian Inference and Information Bottleneck are the two most popular o...
research
07/02/2018

Uncertainty in the Variational Information Bottleneck

We present a simple case study, demonstrating that Variational Informati...
research
10/23/2019

Variational Predictive Information Bottleneck

In classic papers, Zellner demonstrated that Bayesian inference could be...
research
01/10/2013

Multivariate Information Bottleneck

The Information bottleneck method is an unsupervised non-parametric data...
research
05/24/2016

Relevant sparse codes with variational information bottleneck

In many applications, it is desirable to extract only the relevant aspec...
research
06/08/2020

The Dual Information Bottleneck

The Information Bottleneck (IB) framework is a general characterization ...
research
05/11/2023

The Cardinality Bound on the Information Bottleneck Representations is Tight

The information bottleneck (IB) method aims to find compressed represent...

Please sign up or login with your details

Forgot password? Click here to reset