Probabilistic Graphical Models 2: Inference

Probabilistic Graphical Models 2: Inference

Course
en
English
This content is rated 3.8235 out of 5
Source
  • From www.coursera.org
Conditions
  • Self-paced
  • Free Access
  • Fee-based Certificate
More info
  • 5 Sequences
  • Advanced Level

Their employees are learning daily with Edflex

  • Safran
  • Air France
  • TotalEnergies
  • Generali
Learn more

Course details

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).
  • Week 1 - 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.
  • 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 inferen...
  • 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 probabilitie...
  • 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 G...
  • Week 4 - 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.
  • 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.

Prerequisite

None.

Instructors

Daphne Koller
Professor
School of Engineering

Editor

Leland Stanford Junior University, better known as Stanford University, is a private American university located in Silicon Valley, south of San Francisco.

Its motto is "Die Luft der Freiheit weht", which means "The wind of freedom blows".

Ranked among the world's top universities in most international rankings, it enjoys great prestige.

Platform

Coursera is a digital company offering massive open online course founded by computer teachers Andrew Ng and Daphne Koller Stanford University, located in Mountain View, California. 

Coursera works with top universities and organizations to make some of their courses available online, and offers courses in many subjects, including: physics, engineering, humanities, medicine, biology, social sciences, mathematics, business, computer science, digital marketing, data science, and other subjects.

This content is rated 3.8235 out of 5
(no review)
This content is rated 3.8235 out of 5
(no review)
Complete this resource to write a review