Winner-Take-All Autoencoders
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). First posted on arXiv 9 Sep 2014.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 1.
2 papers.
- 2022Activation Learning by Local Competitionscited by 6
- 2021Anomaly Detection for Aggregated Data Using Multi-Graph Autoencodercited by 0
- 2022Activation Learning by Local Competitions26 Sep 2022
- 2021Anomaly Detection for Aggregated Data Using Multi-Graph Autoencoder11 Jan 2021