2018 10-708 (CMU) Probabilistic Graphical Models {Lecture 15} [Mean field Approximation]

Posted ecoflex

tags:

篇首语:本文由小常识网(cha138.com)小编为大家整理,主要介绍了2018 10-708 (CMU) Probabilistic Graphical Models {Lecture 15} [Mean field Approximation]相关的知识,希望对你有一定的参考价值。

 

 

 

 

 

 

 

 

 

 p_bar(x) = p(x,e)

p(x) is p(x|e)

 

p_bar is hard to estimate,

but p(x) is easy

and p(x) \\propotion p_bar

 

 

 

 

 

q is easier for sampling, while we cant sample from p

 

 

 

 

 

 

 

 

Occam\'s Razor???

 

 

 

 

 

 

 

以上是关于2018 10-708 (CMU) Probabilistic Graphical Models {Lecture 15} [Mean field Approximation]的主要内容,如果未能解决你的问题,请参考以下文章

2018 10-708 (CMU) Probabilistic Graphical Models {Lecture 5} [Algorithms for Exact Inference]

2018 10-708 (CMU) Probabilistic Graphical Models {Lecture 15} [Mean field Approximation]

2018 10-708 (CMU) Probabilistic Graphical Models {Lecture 21} [A Hybrid: Deep Learning and Graphical

Probabilistic Graphical Models 10-708, Spring 2017

CMU Deep Learning 2018 by Bhiksha Raj 学习记录(10)

CMU Deep Learning 2018 by Bhiksha Raj 学习记录