Auxiliary variational information maximization for dimensionality reduction

1Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Mutual Information (MI) is a long studied measure of information content, and many attempts to apply it to feature extraction and stochastic coding have been made. However, in general MI is computationally intractable to evaluate, and most previous studies redefine the criterion in forms of approximations. Recently we described properties of a simple lower bound on MI, and discussed its links to some of the popular dimensionality reduction techniques [1]. Here we introduce a richer family of auxiliary variational bounds on MI, which generalizes our previous approximations. Our specific focus then is on applying the bound to extracting informative lower-dimensional projections in the presence of irreducible Gaussian noise. We show that our method produces significantly tighter bounds than the well-known as-if Gaussian approximations of Ml. We also show that the auxiliary variable method may help to significantly improve on reconstructions from noisy lower-dimensional projections. © Springer-Verlag Berlin Heidelberg 2006.

Cite

CITATION STYLE

APA

Agakov, F., & Barber, D. (2006). Auxiliary variational information maximization for dimensionality reduction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3940 LNCS, pp. 103–114). https://doi.org/10.1007/11752790_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free