6.438 Algorithms for Inference


Class Info

Introduction to statistical inference with probabilistic graphical models. Directed and undirected graphical models, and factor graphs, over discrete and Gaussian distributions; hidden Markov models, linear dynamical systems. Sum-product and junction tree algorithms; forward-backward algorithm, Kalman filtering and smoothing. Min-sum and Viterbi algorithms. Variational methods, mean-field theory, and loopy belief propagation. Particle methods and filtering. Building graphical models from data, including parameter estimation and structure learning; Baum-Welch and Chow-Liu algorithms. Selected special topics.

This class has 6.008, 6.041B, 6.436, and 18.06 as prerequisites.

6.438 will not be offered this semester. It will be available in the Fall semester, and will be instructed by G. Bresler.

This class counts for a total of 12 credits. This is a graduate-level class.

You can find more information on MIT OpenCourseWare at the Algorithms for Inference site or on the 6.438 Stellar site.

MIT 6.438 Algorithms for Inference Related Textbooks
MIT 6.438 Algorithms for Inference On The Web
Algorithms for Inference
Tags
algorithm factor graph inference

© Copyright 2015