CS 228: Probabilistic Graphical Models: Principles and Techniques
Probabilistic graphical modeling languages for representing complex domains, algorithms for reasoning using these representations, and learning these representations from data. Topics include: Bayesian and Markov networks, extensions to temporal modeling such as hidden Markov models and dynamic Bayesian networks, exact and approximate probabilistic inference algorithms, and methods for learning models from data. Also included are sample applications to various domains including speech recognition, biological modeling and discovery, medical diagnosis, message encoding, vision, and robot motion planning. Prerequisites: basic probability theory and algorithm design and analysis.
Terms: Win
| Units: 3-4
Instructors:
Ermon, S. (PI)
;
Marx, C. (TA)
;
Patel, C. (TA)
;
Sharma, D. (TA)
;
Thomas, G. (TA)
;
Zalouk, S. (TA)
Filter Results: