mi1_11_jt_msg

I made some tea, sat down and tried to solve the exercise

• That's exactly what I did, how'd you know?!

• I wish

• I'm more of a coffee person

• exactly, except for the exercise part

Is this a valid junction tree? (T/F)

• True

• False

• ...depends

Why is this a valid JT?

• because it is a tree and the running intersection property holds

• because it is a tree

• because it's beautiful

• It's not a valid JT

This ν-SVR primal problem: ν is a...

• primal dual variable

• a hypo variable

• hyperparameter

• a multiple of the input dimensions N

This is a chordal graph (T/F)

• True

• False

• Of course

• I want to say False but I'd be guessing

Why does this qualify as a chordal graph?

• because it spells C H O R D

• Because the edge between H and D looks like a chord

• because all cycles have < 4 nodes in them

• because all cycles have >= 4 nodes in them

Where do we get the function potentials from?

• from the knowledge base

• from the DAG

• from the JT

• from the moral graph