English

Winner-Take-All Autoencoders

Machine Learning 2015-06-09 v2 Neural and Evolutionary Computing

Abstract

In this paper, we propose a winner-take-all method for learning hierarchical sparse representations in an unsupervised fashion. We first introduce fully-connected winner-take-all autoencoders which use mini-batch statistics to directly enforce a lifetime sparsity in the activations of the hidden units. We then propose the convolutional winner-take-all autoencoder which combines the benefits of convolutional architectures and autoencoders for learning shift-invariant sparse representations. We describe a way to train convolutional autoencoders layer by layer, where in addition to lifetime sparsity, a spatial sparsity within each feature map is achieved using winner-take-all activation functions. We will show that winner-take-all autoencoders can be used to to learn deep sparse representations from the MNIST, CIFAR-10, ImageNet, Street View House Numbers and Toronto Face datasets, and achieve competitive classification performance.

Keywords

Cite

@article{arxiv.1409.2752,
  title  = {Winner-Take-All Autoencoders},
  author = {Alireza Makhzani and Brendan Frey},
  journal= {arXiv preprint arXiv:1409.2752},
  year   = {2015}
}
R2 v1 2026-06-22T05:52:29.615Z