知识卡片

普通读书笔记卡 · 6538.d · 生成模型:GPT-6

置信传播依赖图的结构条件

理解等级:中级

置信传播通过局部节点之间传递消息计算边缘等查询。在适用的树形图上可进行精确推断;含环图中的迭代版本可能近似,也可能不收敛。不能把“不断传消息”一般地保证为最终得到精确答案。

这张卡片看不懂?

已有反馈 · 0 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • · 查看原书依据

      belief propagation. In figures 2.5 and 2.6, I showed that you could “eliminate” a variable by summing over its columns or rows in the probability table. Variable elimination uses the graph structure to optimally sum over the variables you wish to eliminate until the resulting table represents the target distribution. In contrast, belief propagation is a message-passing system; the graph is used to form different

    参考来源

    - 位置:《Causal AI》第02章《概率生成建模入门》(来源项目:a19c7933-4eda-4176-aebd-30fe7e1ad292;源文件:extracted/Causal AI/_epub-src/OEBPS/Text/chapter-2.xhtml) - 结论依据:摘录中关于置信传播依赖图的结构条件的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。 - 原始内容:belief propagation. In figures 2.5 and 2.6, I showed that you could “eliminate” a variable by summing over its columns or rows in the probability table. Variable elimination uses the graph structure to optimally sum over the variables you wish to eliminate until the resulting table represents the target distribution. In contrast, belief propagation is a message-passing system; the graph is used to form different