Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina...
Transcript of Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina...
![Page 1: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/1.jpg)
Reasoning with graphical models
Slides Set 5:
Rina Dechter
slides5 Compsci 2020
Exact Inference Algorithms Tree-Decomposition Schemes
(Dechter chapter 5, Darwiche chapter 6-7)
![Page 2: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/2.jpg)
Bucket elimination Algorithm BE-bel (Dechter 1996)
∑∏b
Elimination operator
P(e=0)
W*=4”induced width” (max clique size)
bucket B:
P(a)
P(c|a)
P(b|a) P(d|b,a) P(e|b,c)
bucket C:
bucket D:
bucket E:
bucket A:
e=0
B
C
D
E
A
e)(a,Dλ
(a)Eλ
e)c,d,(a,Bλ
e)d,(a,Cλ
∑=
⋅⋅⋅⋅==BCDE
CBEPBADPACPABPAPEAP,,,0
),|(),|()|()|()()0|( α
A
D E
CB
P(a|e=0) slides5 Compsci 2020
![Page 3: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/3.jpg)
Use the ancestral graph only
BE-BEL“Moral” graph
A
D E
CB
slides5 Compsci 2020
![Page 4: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/4.jpg)
Example of pruning irrelevant subnetworks
slides5 Compsci 2020
![Page 5: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/5.jpg)
Example of pruning edges due to evidence or conditioning
slides5 Compsci 2020
![Page 6: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/6.jpg)
slides5 Compsci 2020
![Page 7: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/7.jpg)
FindingAlgorithm BE-mpe (Dechter 1996)
∏bmax Elimination operator
MPE
W*=4”induced width” (max clique size)
bucket B:
P(a)
P(c|a)
P(b|a) P(d|b,a) P(e|b,c)
bucket C:
bucket D:
bucket E:
bucket A:
e=0
B
C
D
E
A
e)(a,hD
(a)hE
e)c,d,(a,hB
e)d,(a,hC
)xP(maxMPEx
=
),|(),|()|()|()(max
by replaced is
,,,,cbePbadPabPacPaPMPE
:
bcdea=
∑ max
slides5 Compsci 2020
![Page 8: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/8.jpg)
Generating the MPE-tuple
C:
E:
P(b|a) P(d|b,a) P(e|b,c)B:
D:
A: P(a)
P(c|a)
e=0 e)(a,hD
(a)hE
e)c,d,(a,hB
e)d,(a,hC
(a)hP(a)max arga' 1. E
a⋅=
0e' 2. =
)e'd,,(a'hmax argd' 3. C
d=
)e'c,,d',(a'h)a'|P(cmax argc' 4.
Bc
××=
)c'b,|P(e')a'b,|P(d')a'|P(bmax argb' 5.
b××
×=
)e',d',c',b',(a' Returnslides5 Compsci 2020
![Page 9: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/9.jpg)
General Graphical Models
slides5 Compsci 2020
![Page 10: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/10.jpg)
General Bucket Elimination
slides5 Compsci 2020
![Page 11: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/11.jpg)
Outline From bucket-elimination (BE) to bucket-tree elimination (BTE)
From BTE to CTE, Acyclic networks, the join-tree algorithm
Generating join-trees, the treewidth
Examples of CTE for Bayesian network
Belief-propagation on acyclic probabilistic networks (poly-trees) and Loopy networks
Conditioning with elimination (Dechter, 7.1, 7.2)
slides5 Compsci 2020
![Page 12: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/12.jpg)
Outline From bucket-elimination (BE) to bucket-tree elimination (BTE)
From BTE to CTE, Acyclic networks, the join-tree algorithm
Generating join-trees, the treewidth
Examples of CTE for Bayesian network
Belief-propagation on acyclic probabilistic networks (poly-trees) and Loopy networks
slides5 Compsci 2020
![Page 13: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/13.jpg)
From BE to Bucket-Tree Elimination(BTE)
D
G
AB C
F
First, observe the BE operates on a tree.
Second, What if we want the marginal on D?
P(D)?
![Page 14: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/14.jpg)
BTE: Allows Messages Both Ways
D
G
AB C
F
Initial buckets+ messages
Output buckets
slides5 Compsci 2020
𝑃𝑃(𝐷𝐷) = �𝑎𝑎,𝑏𝑏
𝑃𝑃(𝐷𝐷|𝑎𝑎, 𝑏𝑏) 𝜋𝜋𝐵𝐵→𝐷𝐷(𝑎𝑎, 𝑏𝑏)𝑃𝑃(𝐹𝐹) = �𝑏𝑏,𝑐𝑐
𝑃𝑃 𝐹𝐹 𝑏𝑏, 𝑐𝑐 𝜋𝜋𝐶𝐶→𝐹𝐹 𝑏𝑏, 𝑐𝑐 𝜆𝜆𝐺𝐺→𝐹𝐹(𝐹𝐹)
![Page 15: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/15.jpg)
Idea of BTE
slides5 Compsci 2020
![Page 16: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/16.jpg)
BTETheorem: When BTE terminates The product of functions in each bucket is the beliefs of the variables joint with the evidence.
elim(i,j) = scope(Bi)– scope(Bj)
slides5 Compsci 2020
![Page 17: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/17.jpg)
Bucket-Tree Construction From the Graph
1. Pick a (good) variable ordering, d.2. Generate the induced ordered graph3. From top to bottom, each bucket of X is mapped to
pairs (variables, functions) 4. The variables are the clique of X, the functions are
those placed in the bucket5. Connect the bucket of X to earlier bucket of Y if Y is
the closest node connected to X
slides5 Compsci 2020
DG
AB C
F
Example: Create bucket tree for ordering A,B,C,D,F,G
![Page 18: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/18.jpg)
Asynchronous BTE:Bucket-tree Propagation (BTP)
slides5 Compsci 2020
![Page 19: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/19.jpg)
Query Answering
slides5 Compsci 2020
![Page 20: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/20.jpg)
BTE: Allows Messages Both Ways
D
G
AB C
F
Initial buckets+ messages
Output buckets
slides5 Compsci 2020
𝑃𝑃(𝐷𝐷) = �𝑎𝑎,𝑏𝑏
𝑃𝑃(𝐷𝐷|𝑎𝑎, 𝑏𝑏) 𝜋𝜋𝐵𝐵→𝐷𝐷(𝑎𝑎, 𝑏𝑏)𝑃𝑃(𝐹𝐹) = �𝑏𝑏,𝑐𝑐
𝑃𝑃 𝐹𝐹 𝑏𝑏, 𝑐𝑐 𝜋𝜋𝐶𝐶→𝐹𝐹 𝑏𝑏, 𝑐𝑐 𝜆𝜆𝐺𝐺→𝐹𝐹(𝐹𝐹)
![Page 21: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/21.jpg)
Complexity of BTE/BTP on Trees
This will be extended to acyclic graphical models shortly
slides5 Compsci 2020
![Page 22: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/22.jpg)
Outline From bucket-elimination (BE) to bucket-tree elimination (BTE)
From BTE to CTE, Acyclic networks, the join-tree algorithm
Examples of CTE for Bayesian network
Belief-propagation on acyclic probabilistic networks (poly-trees) and Loopy networks
slides5 Compsci 2020
![Page 23: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/23.jpg)
From Buckets to Tree-Clusters Merge non-maximal buckets into maximal clusters. Connect clusters into a tree: connect each cluster to one with which it
shares a largest subset of variables. Separators are variable- intersection on adjacent clusters.
F
B,C A,B
A,B
G,F
A,B,C
D,B,A
B,A
A
F,B,C
(A)
DG
AB C
F
A super-bucket-tree is an i-map of the Bayesian network
F
B,C
G,F
A,B,C
D,B,AF,B,C
(B)
F
G,F
A,B,C,D,F
(C)Time exp(3)Memory exp(2)
Time exp(5)Memory exp(1)
![Page 24: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/24.jpg)
Acyclic Graphical Models
Dual network: Each scope of a CPT is a node and each arc is denoted by intersection.
Acylic network: when the dual graph is a tree or has a join-tree
Tree-clustering converts a network into an acyclic one.
slides5 Compsci 2020
![Page 25: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/25.jpg)
From Acyclic Networks
![Page 26: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/26.jpg)
Connectedness and Ascyclic dual Graphs(The Running Intersection Property)
Definition: A graphical model whose dual graph has a join-tree is acyclic
Theorem: BTE is time and space linear on acyclic graphical models
Tree-decomposition: If we transform a general model into an acyclic one it can then be solved by a BTE/BTP scheme. Also known as tree-clustering
slides5 Compsci 2020
![Page 27: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/27.jpg)
property)on intersecti (running subtree connected a forms set the bleeach variaFor 2.
and such that vertex oneexactly is therefunction each For 1.
:satisfying and sets, twox each verte with gassociatin functions,
labeling are and and treea is where,,, triple a is model graphical afor A
χ(v)}V|X{vXXχ(v))scope(pψ(v)p
PpPψ(v)
Xχ(v)Vvψχ(V,E)TT
X,D,Piondecomposit tree
ii
ii
i
∈∈∈⊆∈
∈⊆
⊆∈=><
><ψχ
Tree Decompositions
slides5 Compsci 2020
![Page 28: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/28.jpg)
property)on intersecti (running subtree connected a forms set the bleeach variaFor 2.
and such that vertex oneexactly is therefunction each For 1.
:satisfying and sets, twox each verte with gassociatin functions,
labeling are and and treea is where,,, triple a is model graphical afor A
χ(v)}V|X{vXXχ(v))scope(pψ(v)p
PpPψ(v)
Xχ(v)Vvψχ(V,E)TT
X,D,Piondecomposit tree
ii
ii
i
∈∈∈⊆∈
∈⊆
⊆∈=><
><ψχ
A B Cp(a), p(b|a), p(c|a,b)
B C D Fp(d|b), p(f|c,d)
B E Fp(e|b,f)
E F Gp(g|e,f)
EF
BF
BC
G
E
F
C D
B
A
Tree decomposition
Connectedness, orRunning intersection property
Tree Decompositions
slides5 Compsci 2020
![Page 29: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/29.jpg)
Generating Tree-Decompositions
A bucket-tree of a graphical model is a tree-decomposition of the model
slides5 Compsci 2020
![Page 30: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/30.jpg)
From Buckets to Clusters Merge non-maximal buckets into maximal clusters. Connect clusters into a tree: each cluster to one with which it shares a
largest subset of variables. Separators are variable-intersection on adjacent clusters.
F
B,C A,B
A,B
G,F
A,B,C
D,B,A
B,A
A
F,B,C
(A)
DG
AB C
F
F
B,C
G,F
A,B,C
D,B,AF,B,C
(B)
F
G,F
A,B,C,D,F
(C)Time exp(3)Memory exp(2)
Time exp(5)Memory exp(1)
slides5 Compsci 2020
![Page 31: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/31.jpg)
u v
x1
x2
xn
𝒎𝒎𝒖𝒖→𝒗𝒗
For max-productJust replace ∑With max.
Message Passing on a Tree Decomposition
Cluster(u) = 𝜓𝜓(𝑢𝑢) ∪ {𝑚𝑚𝑋𝑋1→𝑢𝑢 ,𝑚𝑚𝑋𝑋1→𝑢𝑢 ,𝑚𝑚𝑋𝑋2→𝑢𝑢 , …𝑚𝑚𝑋𝑋𝑛𝑛→𝑢𝑢}
Type equation here.
𝒎𝒎𝒖𝒖→𝒗𝒗 =∑𝑒𝑒𝑙𝑙𝑙𝑙𝑙𝑙(𝑢𝑢,𝑣𝑣)𝜓𝜓 𝑢𝑢 ∏𝑟𝑟 ∈𝑛𝑛𝑒𝑒𝑙𝑙𝑛𝑛𝑛𝑏𝑏𝑛𝑛𝑟𝑟 𝑢𝑢 ,𝑟𝑟≠𝑣𝑣 𝒎𝒎𝒓𝒓→𝒖𝒖
Elim(u,v) = cluster(u)-sep(u,v)
slides5 Compsci 2020
![Page 32: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/32.jpg)
Cluster-Tree Elimination
![Page 33: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/33.jpg)
Properties of CTE
Theorem: Correctness and completeness: Algorithm CTE is correct, i.e. it computes the exact joint probability of a single variable and the evidence. Moreover, it generates explicit clusters.
Time complexity: O ( deg × (n+N) × k w*+1 )
Space complexity: O ( N × k sep)where deg = the maximum degree of a node
n = number of variables (= number of CPTs)N = number of nodes in the tree decompositionk = the maximum domain size of a variablew* = the induced width, treewidthsep = the separator size
slides5 Compsci 2020
![Page 34: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/34.jpg)
Generating Join-trees(Junction-trees); a special type of tree-decompositions
slides5 Compsci 2020
![Page 35: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/35.jpg)
slides5 Compsci 2020
![Page 36: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/36.jpg)
slides5 Compsci 2020
![Page 37: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/37.jpg)
Examples of (Join)-Trees ConstructionA
D F
CB
A
B
C
F
D
G G
G
D
F
C
B
A
ABCD
DGF
BCD
BCDFF
D
FG
ABC
ABD
AB
BC
F
BCF
B
slides5 Compsci 2020
![Page 38: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/38.jpg)
Tree-Clustering and Message-Passing
Two join-trees
Message-passing by CTE onThe tree in (b)
slides5 Compsci 2020
![Page 39: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/39.jpg)
Outline From bucket-elimination (BE) to bucket-tree elimination (BTE)
From BTE to CTE, Acyclic networks, the join-tree algorithm
Examples of CTE for Bayesian network
Belief-propagation on acyclic probabilistic networks (poly-trees) and Loopy networks
slides5 Compsci 2020
![Page 40: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/40.jpg)
G
E
F
C D
B
A
)p(b|a
)p(a
),| bap(c
),dp(f|c
)P(d|b),| fbp(e
), fp(g|e
A B Cp(a), p(b|a), p(c|a,b)
B C D Fp(d|b), p(f|c,d)
B E Fp(e|b,f)
E F Gp(g|e,f)
EF
BF
BC
Example of a Tree Decomposition
slides5 Compsci 2020
![Page 41: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/41.jpg)
Cluster-Tree Elimination (CTE), orJoin-Tree Message-passing
),|()|()(),()2,1( bacpabpapcbha
⋅⋅= ∑
),(),|()|(),( )2,3(,
)1,2( fbhdcfpbdpcbhfd
⋅⋅= ∑
),(),|()|(),( )2,1(,
)3,2( cbhdcfpbdpfbhdc
⋅⋅= ∑
),(),|(),( )3,4()2,3( fehfbepfbhe
⋅= ∑
),(),|(),( )3,2()4,3( fbhfbepfehb
⋅= ∑
),|(),()3,4( fegGpfeh e==G
E
F
C D
B
AABC
2
4
1
3 BEF
EFG
EF
BF
BC
BCDF
Time: O ( exp(w+1) )Space: O ( exp(sep) )
For each cluster P(X|e) is computed, also P(e)
CTE is exact
![Page 42: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/42.jpg)
Outline From bucket-elimination (BE) to bucket-tree elimination (BTE)
From BTE to CTE, Acyclic networks, the join-tree algorithm
Examples of CTE for Bayesian network
Belief-propagation on acyclic probabilistic networks (poly-trees) and Loopy networks
slides5 Compsci 2020
![Page 43: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/43.jpg)
Polytrees and Acyclic Networks Polytree: a BN whose undirected skeleton is a tree Acyclic network: A network is acyclic if it has a tree-
decomposition where each node has a single original CPT. A polytree is an acyclic model.
slides5 Compsci 2020
![Page 44: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/44.jpg)
Pearl’s Belief Propagation
slides5 Compsci 2020
![Page 45: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/45.jpg)
From Exact to Approximate:Iterative Belief Propagation
Belief propagation is exact for poly-trees IBP - applying BP iteratively to cyclic networks
No guarantees for convergence Works well for many coding networks
)( 11uXλ
1U 2U 3U
2X1X
)( 12xUπ
)( 12uXλ
)( 13xUπ) BEL(U
update :step One
1
slides5 Compsci 2020
![Page 46: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/46.jpg)
Propagation in Both Directions Messages can propagate both ways and we
get beliefs for each variable
P(X)
P(Y|X) P(Z|X)
P(T|Y) P(R|Y) P(L|Z) P(M|Z)
)(XmZX
)(XmXZ
)(ZmZM)(ZmZL
)(ZmMZ)(ZmLZ
)(XmYX
)(XmXY
)(YmTY
)(YmYT
)(YmRY
)(YmYR
slides5 Compsci 2020
![Page 47: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/47.jpg)
Agenda From bucket-elimination (BE) to bucket-tree elimination (BTE)
From BTE to CTE, Acyclic networks, the join-tree algorithm
Generating join-trees, the treewidth
Examples of CTE for Bayesian network
Belief-propagation on acyclic probabilistic networks (poly-trees) and Loopy networks
Conditioning with elimination (Dechter, 7.1, 7.2)
slides5 Compsci 2020
![Page 48: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/48.jpg)
The Idea of Cutset-Conditioning
slides5 Compsci 2020
![Page 49: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/49.jpg)
The Cycle-Cutset Scheme:Condition Until Treeness
• Cycle-cutset• i-cutset• C(i)-size of i-cutset
Space: exp(i), Time: O(exp(i+c(i))
![Page 50: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/50.jpg)
Cycle-Cutset Conditioning
C P
J A
L
B
E
DF M
O
H
K
G N
C P
J
L
B
E
DF M
O
H
K
G N
A
C P
J
L
E
DF M
O
H
K
G N
B
P
J
L
E
DF M
O
H
K
G N
C
Cycle cutset = {A,B,C}
C P
J A
L
B
E
DF M
O
H
K
G N
C P
J
L
B
E
DF M
O
H
K
G N
C P
J
L
E
DF M
O
H
K
G N
C P
J A
L
B
E
DF M
O
H
K
G N
1-cutset = {A,B,C}, size 3
![Page 51: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/51.jpg)
Search Over the Cutset (cont)
A=yellow A=green
B=red B=blue B=red B=blueB=green B=yellow
C
K
G
LD
FH
M
J
E
C
K
G
LD
FH
M
J
E
C
K
G
LD
FH
M
J
E
C
K
G
LD
FH
M
J
E
C
K
G
LD
FH
M
J
E
C
K
G
LD
FH
M
J
E
• Inference may require too much memory
• Condition on some of the variablesA
C
B K
G
LD
FH
M
J
E
GraphColoringproblem
2-cutset = {A,B}, size =2
![Page 52: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/52.jpg)
The Impact of Observations
Induced graphOrdered graph Ordered conditioned graph
![Page 53: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/53.jpg)
The Idea of Cutset-Conditioning
We observed that when variables are assigned, connectivity reduces.The magnitude of saving is reflected through the “conditioned-induced graph”
• Cutset-conditioning exploit this in a systematic way: • Select a subset of variables, assign them values, and • Solve the conditioned problem by bucket-elimination. • Repeat for all assignments to the cutset.
Algorithm VEC
slides5 Compsci 2020
![Page 54: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/54.jpg)
Conditioning+Elimination
∑∑∑∑=
==0
),|(),|()|()|()()0,(edcb
cbePbadPacPabPaPeaP
Idea: conditioning until of a (sub)problem gets small*w
slides5 Compsci 2020
![Page 55: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/55.jpg)
Loop-Cutset Conditioning You condition until you get a polytree
BCB
F
A
BCB
F
A=0 A=0 A=0
BCB
F
A=1 A=1 A=1
P(B|F=0) = P(B, A=0|F=0)+P(B,A=1|F=0)
A=0 A=1
Loop-cutset method is time exponential in loop-cutset sizebut linear space. For each cutset we can do BP.
![Page 56: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/56.jpg)
Loop-Cutset, q-Cutset, cycle-cutset
A loop-cutset is a subset of nodes of a directed graph that when removed the remaining graph is a poly-tree
A q-cutset is a subset of nodes of an undirected graph that when removed the remaining graph is has an induced-width of q or less.
A cycle-cutset is a q-cutset such that q=1.
slides5 Compsci 2020
![Page 57: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/57.jpg)
Search Over the Cutset (cont)
A=yellow A=green
B=red B=blue B=red B=blueB=green B=yellow
C
K
G
LD
FH
M
J
E
C
K
G
LD
FH
M
J
E
C
K
G
LD
FH
M
J
E
C
K
G
LD
FH
M
J
E
C
K
G
LD
FH
M
J
E
C
K
G
LD
FH
M
J
E
• Inference may require too much memory
• Condition on some of the variablesA
C
B K
G
LD
FH
M
J
E
GraphColoringproblem
2-cutset = {A,B}, size =2
![Page 58: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/58.jpg)
VEC: Variable Elimination with Conditioning;or, q-cutset lgorithms
VEC-bel: Identify a q-cutset, C, of the network For each assignment to C=c solve the conditioned
sub-problem by CTE or BE. Accumulate probabilities. Time complexity: 𝑛𝑛𝑘𝑘𝑐𝑐+𝑞𝑞+1 Space complexity: 𝑛𝑛𝑘𝑘𝑞𝑞
slides5 Compsci 2020
![Page 59: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/59.jpg)
Algorithm VEC (Variable-elimination with conditioning)
![Page 60: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/60.jpg)
VEC and ALT-VEC:Alternate conditioning and Elimination
VEC (q-cutset-conditioining) can also alternate search and elimination, yielding ALT-VEC.
A time-space tradeoff
slides5 Compsci 2020
![Page 61: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/61.jpg)
Search Basic Step: Conditioning
X1
X3
X5X4
X2
slides5 Compsci 2020
![Page 62: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/62.jpg)
Search Basic Step: Conditioning
X1
X3
X5X4
X2• Select a variable
slides5 Compsci 2020
![Page 63: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/63.jpg)
Search Basic Step: Conditioning
X1
X3
X5X4
X2
X3
X5X4
X2
X3
X5X4
X2
X3
X5X4
X2
…...
…...
X1 ← aX1 ← b
X1 ← c
slides5 Compsci 2020
![Page 64: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/64.jpg)
Search Basic Step: Variable Branching by Conditioning
X1
X3
X5X4
X2
X3
X5X4
X2
X3
X5X4
X2
X3
X5X4
X2
…...
…...
X1 ← aX1 ← b
X1 ← c
General principle:Condition until tractableThen solve sub-problemsefficiently
slides5 Compsci 2020
![Page 65: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/65.jpg)
Search Basic Step: Variable Branching by Conditioning
X1
X3
X5X4
X2
X3
X5X4
X2
X3
X5X4
X2
X3
X5X4
X2
…...
…...
X1 ← aX1 ← b
X1 ← c
Example: solve subproblem by inference, BE(i=2)
slides5 Compsci 2020
![Page 66: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/66.jpg)
Eliminate First
slides5 Compsci 2020
![Page 67: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/67.jpg)
Eliminate First
slides5 Compsci 2020
![Page 68: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/68.jpg)
Eliminate First
Solve the rest of the problemby any means
slides5 Compsci 2020
![Page 69: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/69.jpg)
Hybrids Variants Condition, condition, condition … and then
only eliminate (w-cutset, cycle-cutset)
Eliminate, eliminate, eliminate … and then only search
Interleave conditioning and elimination (elim-cond(i), VE+C)
slides5 Compsci 2020
![Page 70: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/70.jpg)
Interleaving Conditioning and Elimination(Larrosa & Dechter, CP’02)
slides5 Compsci 2020
![Page 71: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/71.jpg)
Interleaving Conditioning and Elimination
slides5 Compsci 2020
![Page 72: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/72.jpg)
Interleaving Conditioning and Elimination
slides5 Compsci 2020
![Page 73: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/73.jpg)
Interleaving Conditioning and Elimination
slides5 Compsci 2020
![Page 74: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/74.jpg)
Interleaving Conditioning and Elimination
slides5 Compsci 2020
![Page 75: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/75.jpg)
Interleaving Conditioning and Elimination
slides5 Compsci 2020
![Page 76: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/76.jpg)
Interleaving Conditioning and Elimination
...
...
slides5 Compsci 2020
![Page 77: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/77.jpg)
What Hybrid Should We Use? q=1? (loop-cutset?) q=0? (Full search?) q=w* (Full inference)? q in between? depends… on the graph What is relation between cycle-cutset
and the induced-width?
slides5 Compsci 2020
![Page 78: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/78.jpg)
Properties of Conditioning+Elimination
slides5 Compsci 2020
![Page 79: Slides Set 5dechter/courses/ics-276/winter...Reasoning with graphical models Slides Set 5: Rina Dechter slides5 Compsci 2020 Exact Inference Algorithms Tree-Decomposition Schemes (Dechter](https://reader034.fdocuments.us/reader034/viewer/2022051900/5fee8dc86ae7115c872676e7/html5/thumbnails/79.jpg)
Tradeoff between w* and q-cutstes
slides5 Compsci 2020