Deep, narrow sigmoid belief networks are universal approximators

  • Authors:
  • Ilya Sutskever;Geoffrey E. Hinton

  • Affiliations:
  • Department of Computer Science, University of Toronto, Toronto, Ontario M55 3G4, Canada. ilya@cs.utoronto.ca;Department of Computer Science, University of Toronto, Toronto, Ontario M55 3G4, Canada. hinton@cs.utoronto.ca

  • Venue:
  • Neural Computation
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this note, we show that exponentially deep belief networks can approximate any distribution over binary vectors to arbitrary accuracy, even when the width of each layer is limited to the dimensionality of the data. We further show that such networks can be greedily learned in an easy yet impractical way.