The Restricted Boltzmann Machine (RBM) is a popular density model that is also good for extracting features. A main source of tractability in RBM models is that, given an input, the posterior distribution over hidden variables is factorizable and can be easily computed and sampled from. Sparsity and competition in the hidden representation is beneficial, and while an RBM with competition among its hidden units would acquire some of the attractive properties of sparse coding, such constraints are typically not added, as the resulting posterior over the hid- den units seemingly becomes intractable. In this paper we show that a dynamic programming algorithm can be used to implement exact sparsity in the RBM’s hidden units. We also show how to pass derivatives through the resulting posterior marginals, which makes it possible to fine-tune a pre-trained neural network with sparse hidden layers.
@conference{swersky2012cardinality,
year = {2012},
author = {Swersky, Kevin and Tarlow, Daniel and Sutskever, Ilya and Salakhutdinov, Ruslan and Zemel, Richard S. and Adams, Ryan P.},
title = {Cardinality Restricted {B}oltzmann Machines},
booktitle = {Advances in Neural Information Processing Systems (NIPS) 25},
keywords = {restricted Boltzmann machines, NIPS}
}