Auxiliary variational information maximization for dimensionality reduction

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3940 LNCS, Issue , 2006, Pages 103-114

  Agakov, Felix ^a   Barber, David ^b  

^a UNIVERSITY OF EDINBURGH   (United Kingdom)

^b IDIAP RESEARCH INSTITUTE   (Switzerland)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; DATA REDUCTION; FEATURE EXTRACTION; GAUSSIAN NOISE (ELECTRONIC); IMAGE RECONSTRUCTION; INFORMATION RETRIEVAL; PROJECTION SYSTEMS; STOCHASTIC CONTROL SYSTEMS;

AUXILIARY VARIATIONAL BOUNDS; LOWER-DIMENSIONAL PROJECTIONS; MUTUAL INFORMATION (MI); STOCHASTIC CODING;

INFORMATION TECHNOLOGY;

EID: 33745873545     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11752790_6     Document Type: Conference Paper

References (17)

1. Barber, D., Agakov, F.V.: The IM Algorithm: A Variational Approach to Information Maximization. In: NIPS, MIT Press (2003)
2. Linsker, R.: An Application of the Principle of Maximum Information Preservation to Linear Systems. In Touretzky, D., ed.: Advances in Neural Information Processing Systems. Volume 1., Morgan-Kaufmann (1989)
3. Bell, A.J., Sejnowski, T.J.: An information-maximization approach to blind separation and blind deconvolution. Neural Computation 7(6) (1995) 1129-1159
4. Brunel, N., Nadal, J.P.: Mutual Information, Fisher Information and Population Coding. Neural Computation 10 (1998) 1731-1757
5. Agakov, F.V., Barber, D.: Variational Information Maximization for Neural Coding. In: International Conference on Neural Information Processing, Springer (2004)
6. Agakov, F.V.: Variational Information Maximization in Stochastic Environments. PhD thesis, School of Informatics, University of Edinburgh (2005)
7. C. Bishop, M. Svensen and C. K. I. Williams: GTM: The Generative Topographic Mapping. Neural Computation 10(1) (1998) 215-234
8. Tipping, M.E., Bishop, C.M.: Mixtures of Probabilistic Principal Component Analyzers. Neural Computation 11(2) (1999) 443-482
9. Linsker, R.: Deriving Receptive Fields Using an Optimal Encoding Criterion. In Steven Hanson, Jack Cowan, L.G.e., ed.: Advances in Neural Information Processing Systems. Volume 5., Morgan-Kaufmann (1993)
10. Neal, R.M., Hinton, G.E.: A View of the EM Algorithm That Justifies Incremental, Sparse, and Other Variants. In Jordan, M., ed.: Learning in Graphical Models. Kluwer Academic (1998)
11. Cover, T.M., Thomas, J.A.: Elements of Information Theory. Wiley (1991)
12. Arimoto, S.: An Algorithm for computing the capacity of arbitrary discrete memoryless channels. IT 18 (1972)
13. Blahut, R.: Computation of channel capacity and rate-distortion functions. IT 18 (1972)
14. Jacobs, R.A., I.Jordan, M., Nowlan, S.J., Hinton, G.E.: Adaptive Mixtures of Local Experts. Neural Computation 3 (1991)
15. Tishby, N., Pereira, F.C., Bialek, W.: The information bottleneck method. In: Proc. of the 37-th Annual Allerton Conference on Communication, Control and Computing. (1999) 368-377
16. LeCun, Y., Cortes, C.: The MNIST database of handwritten digits (1998)
17. Cardoso, J.F.: Infomax and maximum likelihood for blind source separation. In: IEEE Signal Processing Letters. Volume 4. (1997)