Stanford CS228 Probabilistic Graphical Models course notes

Stanford CS228 Probabilistic Graphical Models course notes
5/5 based on 1 votes.
These notes form a concise introductory course on probabilistic graphical models. They are based on Stanford CS228, taught by Stefano Ermon, and have been written by Volodymyr Kuleshov, with the help of many students and course staff. The notes are still under construction! Although we have written up most of the material, you will probably find several typos. If you do, please let us know, or submit a pull request with your fixes to our Github repository. You too may help make these notes better by submitting your improvements to us via Github.

This course starts by introducing probabilistic graphical models from the very basics and concludes by explaining from first principles the variational auto-encoder, an important probabilistic model that is also one of the most influential recent results in deep learning.
Submitted by elementlist on Apr 23, 2017
886 views. Averaging 0 views per day.

Post Reply

Please login or register if you wish to leave a comment.

Quick Search


3,012 listings in 21 categories, with 2,271,527 clicks. Directory last updated Sep 12, 2023. Welcome Amara Fatima, the newest member.