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.
Ce cours fait partie de la Spécialisation Modèles graphiques probabilistes
Offert par
Spécialisation Modèles graphiques probabilistes Université de StanfordÀ propos de ce cours
20,596 consultations récentes
Résultats de carrière des étudiants
33%
ont commencé une nouvelle carrière après avoir terminé ce cours
12%
ont bénéficié d'un avantage concret dans leur carrières grâce à ce cours
12%
a obtenu une augmentation de salaire ou une promotion
Certificat partageable
Obtenez un Certificat lorsque vous terminez
100 % en ligne
Commencez dès maintenant et apprenez aux horaires qui vous conviennent.
Cours 2 sur 3 dans le
Dates limites flexibles
Réinitialisez les dates limites selon votre disponibilité.
Niveau avancé
Approx. 38 heures pour terminer
Anglais
Sous-titres : Français, Portugais (européen), Russe, Anglais, Espagnol
Compétences que vous acquerrez
InferenceGibbs SamplingMarkov Chain Monte Carlo (MCMC)Belief Propagation
Résultats de carrière des étudiants
33%
ont commencé une nouvelle carrière après avoir terminé ce cours
12%
ont bénéficié d'un avantage concret dans leur carrières grâce à ce cours
12%
a obtenu une augmentation de salaire ou une promotion
Certificat partageable
Obtenez un Certificat lorsque vous terminez
100 % en ligne
Commencez dès maintenant et apprenez aux horaires qui vous conviennent.
Cours 2 sur 3 dans le
Dates limites flexibles
Réinitialisez les dates limites selon votre disponibilité.
Niveau avancé
Approx. 38 heures pour terminer
Anglais
Sous-titres : Français, Portugais (européen), Russe, Anglais, Espagnol
Offert par
Université de Stanford
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.
Programme du cours : ce que vous apprendrez dans ce cours
25 minutes pour terminer
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).
25 minutes pour terminer
2 vidéos (Total 25 min)
1 heure pour terminer
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.
1 heure pour terminer
4 vidéos (Total 56 min)
4 vidéos
Complexity of Variable Elimination12 min
Graph-Based Perspective on Variable Elimination15 min
Finding Elimination Orderings11 min
1 exercice pour s'entraîner
Variable Elimination30 min
18 heures pour terminer
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.
18 heures pour terminer
9 vidéos (Total 150 min)
9 vidéos
Properties of Cluster Graphs15 min
Properties of Belief Propagation9 min
Clique Tree Algorithm - Correctness18 min
Clique Tree Algorithm - Computation16 min
Clique Trees and Independence15 min
Clique Trees and VE16 min
BP In Practice15 min
Loopy BP and Message Decoding21 min
2 exercices pour s'entraîner
Message Passing in Cluster Graphs30 min
Clique Tree Algorithm30 min
2 heures pour terminer
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.
2 heures pour terminer
5 vidéos (Total 74 min)
5 vidéos
Max Sum Message Passing20 min
Finding a MAP Assignment3 min
Tractable MAP Problems15 min
Dual Decomposition - Intuition17 min
Dual Decomposition - Algorithm16 min
1 exercice pour s'entraîner
MAP Message Passing30 min
15 heures pour terminer
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.
15 heures pour terminer
5 vidéos (Total 100 min)
5 vidéos
Simple Sampling23 min
Markov Chain Monte Carlo14 min
Using a Markov Chain15 min
Gibbs Sampling19 min
Metropolis Hastings Algorithm27 min
2 exercices pour s'entraîner
Sampling Methods30 min
Sampling Methods PA Quiz30 min
1 heure pour terminer
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 heure pour terminer
1 vidéo (Total 20 min)
1 vidéo
1 exercice pour s'entraîner
Inference in Temporal Models30 min
Avis
Meilleurs avis pour PROBABILISTIC GRAPHICAL MODELS 2: INFERENCE
par AT22 août 2019
Just like the first course of the specialization, this course is really good. It is well organized and taught in the best way which really helped me to implement similar ideas for my projects.
par AL19 août 2019
I have clearly learnt a lot during this course. Even though some things should be updated and maybe completed, I would definitely recommend it to anyone whose interest lies in PGMs.
par LC31 juil. 2018
Very good course. Subject is quiet complex: lack of concrete examples to make sure concepts well understood. Had to review each the Course twice to understand concepts well
par RG15 mai 2020
Great course. The assignments are old and are not worth doing it. But the content is good for those who are interested in Probabilistic Graphical Models basics.
À propos du Spécialisation Modèles graphiques probabilistes
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.
Foire Aux Questions
Quand aurai-je accès aux vidéos de cours et aux devoirs ?
À quoi ai-je droit si je m'abonne à cette Spécialisation ?
Is financial aid available?
Learning Outcomes: By the end of this course, you will be able to take a given PGM and
Puis-je obtenir des crédits universitaires si je réussis le Cours ?
D'autres questions ? Visitez le Centre d'Aide pour les Etudiants.
