A Winner-Take-All Method for Training Sparse Convolutional Autoencoders

By Alireza Makhzani, Brendan J. Frey. 2014

33 citations recorded by the source corpus.

We explore combining the benefits of convolutional architectures and autoencoders for learning deep representations in an unsupervised manner. A major challenge is to achieve appropriate sparsity among hidden variables, since neighbouring variables in each feature map tend to be highly correlated and a suppression mechanism is therefore needed. Previously, deconvolutional networks and convolutional predictive sparse decomposition have been used to construct systems that have a recognition pathway and a data generation pathway that are trained so that they agree and so that the hidden representation is sparse. We take a more direct approach and describe a way to train convolutional autoencoders layer by layer, where in each layer sparsity is achieved using a winner-take-all activation function within each feature map. Learning is computationally efficient and we show that our method can be used to train shallow and deep convolutional autoencoders whose representations can be used to achieve classification rates on the MNIST, CIFAR-10 and NORB datasets that are competitive with the state of the art.

Subfields: Computer Vision and Pattern Recognition, Generative Models

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computer Vision and Pattern Recognition

  1. Luc Van Gool
  2. Dacheng Tao
  3. Xiaogang Wang
  4. Trevor Darrell
  5. Jitendra Malik
  6. Ming-Hsuan Yang
  7. Andrea Vedaldi
  8. Andrew Zisserman

In Generative Models

  1. Yann LeCun
  2. Yoshua Bengio
  3. Junbo Jake Zhao
  4. Michaël Mathieu
  5. Kevin Swersky
  6. Richard S. Zemel
  7. Ayman S. El-Baz
  8. Ehsan Hosseini-Asl

Citations in the corpus