HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS		QUICK SEARCH:   [advanced] Author: Keyword(s): Year:  Vol:  Page:

This Article Full Text Full Text (PDF) Alert me when this article is cited Alert me if a correction is posted Services Similar articles in this journal Similar articles in PubMed Alert me to new issues of the journal Download to citation manager Citing Articles Citing Articles via HighWire Citing Articles via Google Scholar Google Scholar Articles by Girolami, M. Search for Related Content PubMed PubMed Citation Articles by Girolami, M.

A Variational Method for Learning Sparse and Overcomplete Representations

Laboratory of Computing and Information Science, Helsinki University of Technology, Finland

An expectation-maximization algorithm for learning sparse and overcomplete data representations is presented. The proposed algorithm exploits a variational approximation to a range of heavy-tailed distributions whose limit is the Laplacian. A rigorous lower bound on the sparse prior distribution is derived, which enables the analytic marginalization of a lower bound on the data likelihood. This lower bound enables the development of an expectation-maximization algorithm for learning the overcomplete basis vectors and inferring the most probable basis coefficients.

This article has been cited by other articles:

				Z. He, S. Xie, L. Zhang, and A. Cichocki A note on lewicki-sejnowski gradient for learning overcomplete representations. Neural Comput., March 1, 2008; 20(3): 636 - 643. [Abstract] [Full Text] [PDF]

				S.-i. Maeda, W.-J. Song, and S. Ishii Nonlinear and Noisy Extension of Independent Component Analysis: Theory and Its Application to a Pitch Sensation Model Neural Comput., January 1, 2005; 17(1): 115 - 144. [Abstract] [Full Text] [PDF]

				K. Kreutz-Delgado, J. F. Murray, B. D. Rao, K. Engan, T.-W. Lee, and T. J. Sejnowski Dictionary Learning Algorithms for Sparse Representation Neural Comput., February 1, 2003; 15(2): 349 - 396. [Abstract] [Full Text] [PDF]