Hinton, Osindero and Teh (2006) describe a fast, greedy learning algorithm that can find a fairly good set of parameters even in deep networks with millions of parameters and many hidden layers.
One recorded claim. The claim panel gives its qualification, the source passages with their place in each source, and how it was checked.
What it connects
A fast learning algorithm for deep belief nets → discusses →
Where it appears
No collection page holds this claim. It is listed with its records in the explorer.