Training Restricted Boltzmann Machines using Approximations to the Likelihood Gradient
published: July 29, 2008, recorded: July 2008, views: 1344
Slides
Related content
Report a problem or upload files
If you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
Description
A new algorithm for training Restricted Boltzmann Machines is introduced. The algorithm, named Persistent Contrastive Divergence, is different from the standard Contrastive Divergence algorithms in that it aims to draw samples from almost exactly the model distribution. It is compared to some standard Contrastive Divergence algorithms on the tasks of modeling handwritten digits and classifying digit images by learning a model of the joint distribution of images and labels. The Persistent Contrastive Divergence algorithm outperforms other Contrastive Divergence algorithms, and is equally fast and simple.
See Also:
Launch in a standalone WM Player
Switch to Windows Media Player
Download slides:
icml08_tieleman_trb_01.pdf (296.2 KB)
Download slides:
icml08_tieleman_trb_01.ppt (835.0 KB)
Join a Study Group
You reached a lecture within the PASCAL NoE project video collection. Click on the logo and go to the Computer Science classroom on OpenStudy. Through this classroom, you can meet other students interested in the same problems and work together on assignments, ask each other questions or just discuss the topics of the lecture.
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !





Write your own review or comment: