Using Fast Weights to Improve Persistent Contrastive Divergence
Description
The most commonly used learning algorithm
for restricted Boltzmann machines is contrastive divergence which starts a Markov
chain at a data point and runs the chain
for only a few iterations to get a cheap, low
variance estimate of the sufficient statistics
under the model. Tieleman (2008) showed
that better learning can be achieved by estimating the model’s statistics using a small
set of persistent ”fantasy particles” that are
not reinitialized to data points after each
weight update. With sufficiently small weight
updates, the fantasy particles represent the
equilibrium distribution accurately but to explain why the method works with much larger
weight updates it is necessary to consider the
interaction between the weight updates and
the Markov chain. We show that the weight
updates force the Markov chain to mix fast,
and using this insight we develop an even
faster mixing chain that uses an auxiliary set
of ”fast weights” to implement a temporary
overlay on the energy landscape. The fast
weights learn rapidly but also decay rapidly
and do not contribute to the normal energy
landscape that defines the model.
| Slides | |
| 0:00 | Using Fast Weights to Improve Persistent Contrastive Divergence |
| 0:49 | What this is about |
| 1:27 | MRF Learning |
| 3:02 | The problem with CD - 1 |
| 3:29 | The problem with CD - 2 |
| 3:39 | PCD (part 1) |
| 4:30 | PCD (part 2) |
| 5:01 | PCD Pseudocode |
| 6:10 | Let's take a step back |
| 6:19 | Really? |
| 6:47 | The mixing rate - 1 |
| 9:59 | The mixing rate - 2 |
| 10:59 | The mixing rate - 3 |
| 11:25 | The mixing rate - 4 |
| 11:49 | The mixing rate - 5 |
| 12:23 | The mixing rate - 6 |
| 12:46 | The mixing rate - 7 |
| 13:06 | Learning accelerates mixing |
| 15:40 | New idea |
| 16:57 | FPCD Pseudocode |
| 18:11 | Additional notes |
| 18:53 | Results |
| 20:17 | Conclusion |
| 21:00 | The End |
Lecture rating
| People found this lecture: | ||
| Worth seeing | ||
| because it is: | ||
| Valuable and informative | ||
| Well presented | ||
| Easily understandable | ||
| Acceptably recorded | ||
| You need to login to cast your vote. | ||
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.
Related content
SEE ALSO:
Link this page
Would you like to put a link to this lecture on your homepage?Go ahead! Copy the HTML snippet !




