Dynamic Programming & Hidden Markov Models. Alan Yuille Dept. Statistics UCLA. 1. Chair. Goal of this Talk. This talk introduces one of the major algorithms: dynamic programming (DP). Then describe how it can be used in conjunction with EM for learning. Dynamic Programming.
Dept. Statistics UCLA
The structure means that the sum over x2 drops out. We need
only sum over x1 and x3. Only four operations instead of eight.
or P(A,B) = P(B|A) P(A)
Original Variables: Loops
Augmented Variables: No Loops