The information bottleneck method is a technique introduced by Naftali Tishby et al. for finding the best tradeoff between accuracy and complexity (compression) when summarizing (e.g. clustering) a random variable X, given a joint probability distribution between X and an observed relevant variable Y. Other applications include distributional clustering, and dimension reduction. In a well defined sense it generalized the classical notion of minimal sufficient statistics from parametric statistics to arbitrary distributions, not necessarily of exponential form. It does so by relaxing the sufficiency condition to capture some fraction of the mutual information with the relevant variable Y.
The compressed variable is and the algorithm minimises the following quantity
where are the mutual information between and respectively.
Read more about Information Bottleneck Method: Gaussian Information Bottleneck, Defining Decision Contours, Bibliography
Famous quotes containing the words information and/or method:
“When action grows unprofitable, gather information; when information grows unprofitable, sleep.”
—Ursula K. Le Guin (b. 1929)
“There is assuredly no more effectual method of clearing up one’s own mind on any subject than by talking it over, so to speak, with men of real power and grasp, who have considered it from a totally different point of view.”
—Thomas Henry Huxley (1825–95)