CS228: Probabilistic Methods in AI
Winter 2008
Weekly Quiz


Overall Score Statistics:
Mean Median Mode LowestHighest
84.23% 86% 86% (21) 43% 100%

Score Frequency Table
Frequency of Scores
ScoreNumber of Students
100%19
86%21
71%11
57%4
43%2

Detailed Question/Answer Statistics:
Question 1: Consider the simple Markov chain shown in the figure below. By definition, a stationary distribution for this chain must satisfy which of the following properties?


Answers: 1. I, III and V 2. II, IV, and VI 3. I, IV, and V 4. I, IV, and VI 5. None of the above

TypeAnswerResponsesPercent
Correct:I, IV, and VI57100%
Distractor:I, III and V00%
Distractor:II, IV, and VI00%
Distractor:I, IV, and V00%
Distractor:None of the above00%
Question 2: Which of the following finite state Markov chain structures cannot have a unique statitionary distribution (under any parameterization)?


Answers: 1. Markov chain A. 2. Markov chain B. 3. Markov chain C.

TypeAnswerResponsesPercent
Correct:Markov chain B.5189%
Distractor:Markov chain A.47%
Distractor:Markov chain C.24%
Question 3: Suppose we are running the Gibbs sampling algorithm on the Bayesian network $X \rightarrow Y  \rightarrow Z$. If the current sample is < x0, y0, z0 >, in a single step of the Gibbs sampler, with what probability will the next sample be < x0, y1, z0 >?
Answers: 1. P(x0, y1, z0) 2. P(y1 | x0, z0) 3. P(y1 | x0) 4. P(x0, z0 | y1)
TypeAnswerResponsesPercent
Correct:P(y<sup>1</sup> &#124; x<sup>0</sup>, z<sup>0</sup>)5291%
Distractor:P(x<sup>0</sup>, y<sup>1</sup>, z<sup>0</sup>)24%
Distractor:P(y<sup>1</sup> &KPHHASH124; x<sup>0</sup>)24%
Distractor:P(x<sup>0</sup>, z<sup>0</sup> &KPHHASH124; y<sup>1</sup>)12%
Question 4: Consider the case of exact clique tree inference applied to a DBN. Taking the last clique in the chain to be the root, we need to perform BOTH forward and backward message passing if we wish to solve which inference tasks?
Answers: 1. tracking (or filtering) 2. prediction 3. smoothing 4. prediction and smoothing
TypeAnswerResponsesPercent
Correct:smoothing5088%
Distractor:tracking (or filtering)00%
Distractor:prediction00%
Distractor:prediction and smoothing712%
Question 5: In which of the following 2-TBNs will (X(t) ⊥ Z(t) | Y(t)) hold over time, assuming Obs(t) is observed for all t and the others are never observed?
Answers: 1. (a) 2. (b) 3. (c) 4. All of the above
TypeAnswerResponsesPercent
Correct:(b)2951%
Distractor:(a)24%
Distractor:(c)12%
Distractor:All of the above2544%
Question 6: Given the 2-TBN shown below, if we have belief state [0.5, 0.5] at time t, what is the belief state at time t+1?


Answers: 1. [0.2, 0.8] 2. [0.8, 0.2] 3. [0.5, 0.5] 4. [0.0, 1.0]

TypeAnswerResponsesPercent
Correct:[0.5, 0.5]57100%
Distractor:[0.2, 0.8]00%
Distractor:[0.8, 0.2]00%
Distractor:[0.0, 1.0]00%
Question 7: Consider the 2-TBN shown below, with O always observed. If we observe O(t) = 0 at some time t in the unrolled DBN, then which of the following represents the belief state X(t)?


Answers: 1. [1.0, 0.0] 2. [0.2, 0.8] 3. [0.67, 0.33] 4. can't be determined

TypeAnswerResponsesPercent
Correct:can't be determined4070%
Distractor:[1.0, 0.0]24%
Distractor:[0.2, 0.8]00%
Distractor:[0.67, 0.33]1526%
CS228 Class Page
Powered by QuizTest v3.0.31