Transcription of A Fast Learning Algorithm for Deep Belief Nets
{{id}} {{{paragraph}}}
LETTERC ommunicated by Yann Le CunA fast Learning Algorithm for deep Belief NetsGeoffrey E. of Computer Science, University of Toronto, Toronto, Canada M5S 3G4 Yee-Whye of Computer Science, National University of Singapore,Singapore 117543We show how to use complementary priors to eliminate the explaining-away effects that make inference difficult in densely connected Belief netsthat have many hidden layers. Using complementary priors, we derive afast, greedy Algorithm that can learn deep , directed Belief networks onelayer at a time, provided the top two layers form an undirected associa-tive memory. The fast , greedy Algorithm is used to initialize a slowerlearning procedure that fine-tunes the weights using a contrastive ver-sion of the wake-sleep Algorithm . After fine-tuning, a network with threehidden layers forms a very good generative model of the joint distribu-tion of handwritten digit images and their labels.
A Fast Learning Algorithm for Deep Belief Nets 1529 The inference required for forming a percept is both fast and accurate. The learning algorithm is local.
Domain:
Source:
Link to this page:
Please notify us if you found a problem with this document:
{{id}} {{{paragraph}}}