
COMPLETE TWO PROBLEMS FROM AMONG PROBLEMS 6-9 6. (20 pts) Consider the following hidden Markov model (HMM): . x = (...
9. Consider the following hidden Markov model (HMM) (This is the same HMM as in the previous HMM problem): ·X=(x, ,x,Je {0,1)、[i.e., X is a binary sequence of length n] and Y-(Y Rt [i.e. Y is a sequence of n real numbers.) ·X1~" Bernoulli(1/2) ,%) E Ip is the switching probability; when p is small the Markov chain likes to stay in the same state] . conditioned on X, the random variables Yı , . . . , y, are...
3. [20 Points] Assume that we have the Hidden Markov Model (HMM) depicted in the figure below [4 Points] If each of the states can take on k different values and a total of m a. possible (across all states), how many parameters are different observations are required to fully define this HMM? Justify your answer b. [4 Points] What conditional independences hold in this HMM? Justify your answer [12 Points] Suppose that we have binary states (labeled A and...