知识卡片
局部求和避免全局枚举
若N节点链每节点K个离散状态,直接枚举联合配置有Kᴺ规模。利用相邻因子,把求和向内分配并缓存中间结果,可将常规两两势链推断降至O(NK²)。线性是相对于节点数,状态数大时计算仍可昂贵。
这张卡片看不懂?
这张卡片已通过人工审查,不再接受失败反馈。
已有反馈 · 0 条
还没有人提交反馈。
在整书笔记中的位置
- · 概率图模型
原书出处 · 1 处
- · 查看原书依据
That factorization of equation (29.13) is the key step. It reduces the number of terms summed from order |x|3 to order 2 |x|2 for this chain, and for a chain of length N chain, from order |x|N to order (N – 1) |x|2–from exponential to linear dependence on N–a huge computational savings for large N.
参考来源
- 位置:《Foundations of Computer Vision (Antonio Torralba, Phillip Isola etc.)》第29章《概率图模型》(来源项目:a19c7933-4eda-4176-aebd-30fe7e1ad292;源文件:extracted/Foundations of Computer Vision (Antonio Torralba, Phillip Isola etc.)/_epub-src/OPS/xhtml/c029.xhtml)
- 结论依据:摘录中关于局部求和避免全局枚举的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。
- 原始内容:That factorization of equation (29.13) is the key step. It reduces the number of terms summed from order |x|3 to order 2 |x|2 for this chain, and for a chain of length N chain, from order |x|N to order (N – 1) |x|2–from exponential to linear dependence on N–a huge computational savings for large N.