About this course: Probabilistic graphical models (PGMs) are a rich framework for encoding probability distributions over complex domains: joint (multivariate) distributions over large numbers of random variables that interact with each other. These representations sit at the intersection of statistics and computer science, relying on concepts from probability theory, graph algorithms, machine learning, and more. They are the basis for the state-of-the-art methods in a wide variety of applications, such as medical diagnosis, image understanding, speech recognition, natural language processing, and many, many more. They are also a foundational tool in formulating many machine learning problems. This course is the second in a sequence of three. Following the first course, which focused on representation, this course addresses the question of probabilistic inference: how a PGM can be used to answer questions. Even though a PGM generally describes a very high dimensional distribution, its structure is designed so as to allow questions to be answered efficiently. The course presents both exact and approximate algorithms for different types of inference tasks, and discusses where each could best be applied. The (highly recommended) honors track contains two hands-on programming assignments, in which key routines of the most commonly used exact and approximate algorithms are implemented and applied to a real-world problem.
Created by: Stanford University
Taught by: Daphne Koller, Professor
School of Engineering
| Basic Info | Course 2 of 3 in the Probabilistic Graphical Models Specialization |
| Level | Advanced |
| Language | English |
| How To Pass | Pass all graded assignments to complete the course. |
| User Ratings |
Syllabus
WEEK 1
Inference Overview
This module provides a high-level overview of the main types of inference tasks typically encountered in graphical models: conditional probability queries, and finding the most likely assignment (MAP inference).
2 videos
- Video: Overview: Conditional Probability Queries
- Video: Overview: MAP Inference
Variable Elimination
This module presents the simplest algorithm for exact inference in graphical models: variable elimination. We describe the algorithm, and analyze its complexity in terms of properties of the graph structure.
4 videos
- Video: Variable Elimination Algorithm
- Video: Complexity of Variable Elimination
- Video: Graph-Based Perspective on Variable Elimination
- Video: Finding Elimination Orderings
Graded: Variable Elimination
WEEK 2
Belief Propagation Algorithms
This module describes an alternative view of exact inference in graphical models: that of message passing between clusters each of which encodes a factor over a subset of variables. This framework provides a basis for a variety of exact and approximate inference algorithms. We focus here on the basic framework and on its instantiation in the exact case of clique tree propagation. An optional lesson describes the loopy belief propagation (LBP) algorithm and its properties.
9 videos
- Video: Belief Propagation Algorithm
- Video: Properties of Cluster Graphs
- Video: Properties of Belief Propagation
- Video: Clique Tree Algorithm - Correctness
- Video: Clique Tree Algorithm - Computation
- Video: Clique Trees and Independence
- Video: Clique Trees and VE
- Video: BP In Practice
- Video: Loopy BP and Message Decoding
Graded: Message Passing in Cluster Graphs
Graded: Clique Tree Algorithm
Graded: Exact Inference
WEEK 3
MAP Algorithms
This module describes algorithms for finding the most likely assignment for a distribution encoded as a PGM (a task known as MAP inference). We describe message passing algorithms, which are very similar to the algorithms for computing conditional probabilities, except that we need to also consider how to decode the results to construct a single assignment. In an optional module, we describe a few other algorithms that are able to use very different techniques by exploiting the combinatorial optimization nature of the MAP task.
5 videos
- Video: Max Sum Message Passing
- Video: Finding a MAP Assignment
- Video: Tractable MAP Problems
- Video: Dual Decomposition - Intuition
- Video: Dual Decomposition - Algorithm
Graded: MAP Message Passing
WEEK 4
Sampling Methods
In this module, we discuss a class of algorithms that uses random sampling to provide approximate answers to conditional probability queries. Most commonly used among these is the class of Markov Chain Monte Carlo (MCMC) algorithms, which includes the simple Gibbs sampling algorithm, as well as a family of methods known as Metropolis-Hastings.
5 videos
- Video: Simple Sampling
- Video: Markov Chain Monte Carlo
- Video: Using a Markov Chain
- Video: Gibbs Sampling
- Video: Metropolis Hastings Algorithm
Graded: Sampling Methods
Graded: Sampling Methods
Graded: Sampling Methods PA Quiz
Inference in Temporal Models
In this brief lesson, we discuss some of the complexities of applying some of the exact or approximate inference algorithms that we learned earlier in this course to dynamic Bayesian networks.
1 video
- Video: Inference in Temporal Models
Graded: Inference in Temporal Models
WEEK 5
Inference Summary
This module summarizes some of the topics that we covered in this course and discusses tradeoffs between different algorithms. It also includes the course final exam.
1 video
- Video: Inference: Summary
Graded: Inference Final Exam
FAQs
How It Works
Coursework
Each course is like an interactive textbook, featuring pre-recorded videos, quizzes and projects.
Help from Your Peers
Connect with thousands of other learners and debate ideas, discuss course material, and get help mastering concepts.
Certificates
Earn official recognition for your work, and share your success with friends, colleagues, and employers.
Creators
Stanford University
The Leland Stanford Junior University, commonly referred to as Stanford University or Stanford, is an American private research university located in Stanford, California on an 8,180-acre (3,310 ha) campus near Palo Alto, California, United States.
Pricing
| Audit | Purchase Course | |
|---|---|---|
| Access to course materials | Available | Available |
| Access to graded materials | Not available | Available |
| Receive a final grade | Not available | Available |
| Earn a shareable Course Certificate | Not available | Available |
Ratings and Reviews
very good course
Difficult, but it makes you think a lot!
Had a wonderful and enriching fun filled experience, Thank you Daphne Ma'am
Coursera provides universal access to the world’s best education, partnering with top universities and organizations to offer courses online.
© 2017 Coursera Inc. All rights reserved.
JH
Pretty good course, albeit very dense compared to the first one (which was certainly not trivial). I would give it 5 stars just based on the content, but the programming assignments don't work without significant extra effort. I completed the honors track for the first course, but gave up after spending 4 hours trying to fix HW bugs that were reported 8 months ago.
Would have also been nice to have more practical examples to work on. Some of the material is very theoretical, and I find it hard to build intuitions without applying the algorithms in practice.