Energy-Based Models for Sparse Overcomplete Representations
暂无分享,去创建一个
Yee Whye Teh | Geoffrey E. Hinton | Max Welling | Simon Osindero | Simon Osindero | Y. Teh | M. Welling
[1] Geoffrey E. Hinton,et al. Learning internal representations by error propagation , 1986 .
[2] Paul J. Werbos,et al. Backpropagation Through Time: What It Does and How to Do It , 1990, Proc. IEEE.
[3] Edward H. Adelson,et al. Shiftable multiscale transforms , 1992, IEEE Trans. Inf. Theory.
[4] Stéphane Mallat,et al. Matching pursuits with time-frequency dictionaries , 1993, IEEE Trans. Signal Process..
[5] Pierre Comon,et al. Independent component analysis, A new concept? , 1994, Signal Process..
[6] Terrence J. Sejnowski,et al. An Information-Maximization Approach to Blind Separation and Blind Deconvolution , 1995, Neural Computation.
[7] Andrzej Cichocki,et al. A New Learning Algorithm for Blind Signal Separation , 1995, NIPS.
[8] Barak A. Pearlmutter,et al. A Context-Sensitive Generalization of ICA , 1996 .
[9] David J. Field,et al. Emergence of simple-cell receptive field properties by learning a sparse code for natural images , 1996, Nature.
[10] David J. Field,et al. Sparse coding with an overcomplete basis set: A strategy employed by V1? , 1997, Vision Research.
[11] J. Cardoso. Infomax and maximum likelihood for blind source separation , 1997, IEEE Signal Processing Letters.
[12] John D. Lafferty,et al. Inducing Features of Random Fields , 1995, IEEE Trans. Pattern Anal. Mach. Intell..
[13] Song-Chun Zhu,et al. Minimax Entropy Principle and Its Application to Texture Modeling , 1997, Neural Computation.
[14] J. V. van Hateren,et al. Independent component filters of natural images compared with simple cells in primary visual cortex , 1998, Proceedings of the Royal Society of London. Series B: Biological Sciences.
[15] Michael A. Saunders,et al. Atomic Decomposition by Basis Pursuit , 1998, SIAM J. Sci. Comput..
[16] K. Jarrod Millman,et al. Learning Sparse Codes with a Mixture-of-Gaussians Prior , 1999, NIPS.
[17] Hagai Attias,et al. Independent Factor Analysis , 1999, Neural Computation.
[18] Bruno A. Olshausen,et al. PROBABILISTIC FRAMEWORK FOR THE ADAPTATION AND COMPARISON OF IMAGE CODES , 1999 .
[19] Terrence J. Sejnowski,et al. Learning Overcomplete Representations , 2000, Neural Computation.
[20] Daniel D. Lee,et al. An Information Maximization Approach to Overcomplete and Recurrent Representations , 2000, NIPS.
[21] D. Mackay,et al. Failures of the One-Step Learning Algorithm , 2001 .
[22] Yee Whye Teh,et al. Discovering Multiple Constraints that are Frequently Approximately Satisfied , 2001, UAI.
[23] Mark A. Girolami,et al. A Variational Method for Learning Sparse and Overcomplete Representations , 2001, Neural Computation.
[24] Aapo Hyvärinen,et al. A two-layer sparse coding model learns simple and complex cell receptive fields and topography from natural images , 2001, Vision Research.
[25] Mark D. Plumbley,et al. IF THE INDEPENDENT COMPONENTS OF NATURAL IMAGES ARE EDGES, WHAT ARE THE INDEPENDENT COMPONENTS OF NATURAL SOUNDS? , 2001 .
[26] Geoffrey E. Hinton,et al. Learning Sparse Topographic Representations with Products of Student-t Distributions , 2002, NIPS.
[27] Marian Stewart Bartlett,et al. Face recognition by independent component analysis , 2002, IEEE Trans. Neural Networks.
[28] Geoffrey E. Hinton. Training Products of Experts by Minimizing Contrastive Divergence , 2002, Neural Computation.
[29] Christopher K. I. Williams,et al. An analysis of contrastive divergence learning in gaussian boltzmann machines , 2002 .
[30] Aapo Hyvärinen,et al. Estimating Overcomplete Independent Component Bases for Image Windows , 2002, Journal of Mathematical Imaging and Vision.