Contents
ermongroup.github.io · 379 words · saved by 3 readers
Lecture notes for Stanford cs228.
These notes form a concise introductory course on probabilistic graphical modelsProbabilistic graphical models are a subfield of machine learning that studies how to describe and reason about the world in terms of probabilities.. They are based on Stanford CS228, and are written by Volodymyr Kuleshov and Stefano Ermon, 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.…
saved by
related reading
- [1906.02691] An Introduction to Variational Autoencodersarxiv.org
- Pen and Paper Exercises in Machine Learningarxiv.org
- Understanding Deep Learningudlbook.github.io
- Tutorial - What is a variational autoencoder? – Jaan Lı 李jaan.io
- David Duvenaudcs.toronto.edu
- Bayesian Neural Networkscs.toronto.edu
- Writing - betanalpha.github.iobetanalpha.github.io
- Markov random fieldsermongroup.github.io
- Bryon Aragam // University of Chicagobryonaragam.com
- 2403.18103.pdfarxiv.org
- Reinforcement Learning and Control as Probabilistic Inference: Tutorial and Reviewarxiv.org
- Gregory Gundersengregorygundersen.com