Show simple item record

dc.contributor.authorGedeon, Tomáš
dc.contributor.authorParker, Albert E.
dc.contributor.authorDimitrov, Alexander G.
dc.identifier.citationGedeon T, Parker AE, Dimitrov AG, "The mathematical structure of information bottleneck methods," Entropy, March 2012 14(12):456-479en_US
dc.description.abstractInformation Bottleneck-based methods use mutual information as a distortion function in order to extract relevant details about the structure of a complex system by compression. One of the approaches used to generate optimal compressed representations is by annealing a parameter. In this manuscript we present a common framework for the study of annealing in information distortion problems. We identify features that should be common to any annealing optimization problem. The main mathematical tools that we use come from the analysis of dynamical systems in the presence of symmetry (equivariant bifurcation theory). Through the compression problem, we make connections to the world of combinatorial optimization and pattern recognition. The two approaches use very different vocabularies and consider different problems to be “interesting†. We provide an initial link, through the Normalized Cut Problem, where the two disciplines can exchange tools and ideas.en_US
dc.rightsCC BY 4.0en_US
dc.titleThe mathematical structure of information bottleneck methodsen_US
mus.identifier.categoryEngineering & Computer Scienceen_US
mus.identifier.categoryLife Sciences & Earth Sciencesen_US
mus.relation.collegeCollege of Engineeringen_US
mus.relation.collegeCollege of Letters & Scienceen_US
mus.relation.departmentCenter for Biofilm Engineering.en_US
mus.relation.departmentMathematical Sciences.en_US
mus.relation.universityMontana State University - Bozemanen_US
mus.relation.researchgroupCenter for Biofilm Engineering.en_US

Files in this item


This item appears in the following Collection(s)

Show simple item record

CC BY 4.0
Except where otherwise noted, this item's license is described as CC BY 4.0