PASCAL - Pattern Analysis, Statistical Modelling and Computational Learning

Learning and generalization with the information bottleneck
Ohad Shamir, Sivan Sabato and Naftali Tishby
Theoretical Computer Science Volume 411, Number 29-30, pp. 2696-2711, 2010.


The Information Bottleneck is an information theoretic framework that finds concise representations for an `input' random variable that are as relevant as possible for an `output' random variable. This framework has been used successfully in various supervised and unsupervised applications. However, its learning theoretic properties and justification remained unclear as it differs from standard learning models in several crucial aspects, primarily its explicit reliance on the joint inputoutput distribution. In practice, an empirical plug-in estimate of the underlying distribution has been used, so far without any finite sample performance guarantees. In this paper we present several formal results that address these difficulties. We prove several finite sample bounds, which show that the information bottleneck can provide concise representations with good generalization, based on smaller sample sizes than needed to estimate the underlying distribution. The bounds are non-uniform and adaptive to the complexity of the specific model chosen. Based on these results, we also present a preliminary analysis on the possibility of analyzing the information bottleneck method as a learning algorithm in the familiar performance complexity tradeoff framework. In addition, we formally describe the connection between the information bottleneck and minimal sufficient statistics.

PDF - Requires Adobe Acrobat Reader or other PDF viewer.
EPrint Type:Article
Project Keyword:Project Keyword UNSPECIFIED
Subjects:Learning/Statistics & Optimisation
Theory & Algorithms
ID Code:7236
Deposited By:Sivan Sabato
Deposited On:13 March 2011