1 code implementation • Neural Computation 2006 • Geoffrey E. Hinton, Simon Osindero, Yee-Whye Teh
Using complementary priors, we derive a fast, greedy algorithm that can learn deep, directed belief networks one layer at a time, provided the top two layers form an undirected associative memory.
