An Infinite Restricted Boltzmann Machine
Not on the map. Why?
Abstract (arXiv)
We present a mathematical construction for the restricted Boltzmann machine (RBM) that doesn't require specifying the number of hidden units. In fact, the hidden layer size is adaptive and can grow during training. This is obtained by first extending the RBM to be sensitive to the ordering of its hidden units. Then, thanks to a carefully chosen definition of the energy function, we show that the limit of infinitely many hidden units is well defined. As with RBM, approximate maximum likelihood training can be performed, resulting in an algorithm that naturally and adaptively adds trained hidden units during learning. We empirically study the behaviour of this infinite RBM, showing that its performance is competitive to that of the RBM, while not requiring the tuning of a hidden layer size.
Key facts. Cited by 4 papers in the map (data through 13 Oct 2026). First posted on arXiv 9 Feb 2015.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 2; 2022: 2.
4 papers.
- 2021Variable-rate discrete representation learningcited by 24
- 2021The Autodidactic Universecited by 7
- 2022A simple probabilistic neural network for machine understandingcited by 1
- 2022Optimizing Connectivity through Network Gradients for Restricted Boltzmann Machinescited by 0
- 2022A simple probabilistic neural network for machine understanding24 Oct 2022
- 2022Optimizing Connectivity through Network Gradients for Restricted Boltzmann Machines14 Sep 2022
- 2021The Autodidactic Universe29 Mar 2021
- 2021Variable-rate discrete representation learning10 Mar 2021