# Question: This exercise develops a space efficient variant of the forward

This exercise develops a space-efficient variant of the forward—backward algorithm described in Figure. We wish to compute P (X k│e l; t) for k = 1... t. This will be done with a divide-and-conquer approach.

a. Suppose, for simplicity, that t is odd, and let the halfway point he h = (t + 1)/2. Show that P (X k│e l; t) can be computed for k = 1. . , h given just the initial forward message f1:0, the backward message bh+1: t, and the evidence e1:h.

b. Show a similar result for the second half of the sequence.

c. Given the results of (a) and (b), a recursive divide-and-conquer algorithm can be constructed by first running forward along the sequence and then backwards from the end, storing just the required messages at the middle and the ends. Then the algorithm is called on each half. Write out the algorithm in detail.

d. Compute the time and space complexity of the algorithm as a function of t, the length of the sequence. How does this change if we divide the input into more than two pieces?

a. Suppose, for simplicity, that t is odd, and let the halfway point he h = (t + 1)/2. Show that P (X k│e l; t) can be computed for k = 1. . , h given just the initial forward message f1:0, the backward message bh+1: t, and the evidence e1:h.

b. Show a similar result for the second half of the sequence.

c. Given the results of (a) and (b), a recursive divide-and-conquer algorithm can be constructed by first running forward along the sequence and then backwards from the end, storing just the required messages at the middle and the ends. Then the algorithm is called on each half. Write out the algorithm in detail.

d. Compute the time and space complexity of the algorithm as a function of t, the length of the sequence. How does this change if we divide the input into more than two pieces?

## Answer to relevant Questions

We outlined a flawed procedure for finding the most likely state sequence, given an observation sequence. The procedure involves finding the most likely state at each time step, using smoothing, and returning the sequence ...In this exercise, we analyze in more detail the persistent-failure model for the battery sensor in Figure (a). a. Figure (b) stops at t = 32. Describe qualitatively what should happen as t → ∞ if the sensor ...Write a computer program to automate the process in Exercise 16.4. Try your program out on several people of different net worth and political outlook. Comment on the consistency of your results, both for an individual and ...For the 4 x 3 world shown in Figure, calculate which squares can he reached from (1, 1) by the action sequence (Up, Up, Right, Right, Right and with what probabilities. Explain how this computation is related to the task of ...Solve the game of three-finger Morra.Post your question