Forward algorithm

The forward algorithm is one of the algorithms used to solve the decoding problem. Since the development of speech recognition[1] and pattern recognition and related fields like computational biology which use HMMs, the forward algorithm has gained popularity.

The goal of the forward algorithm is to compute the joint probability ${\displaystyle p(x_{t},y_{1:t})}$, where for notational convenience we have abbreviated ${\displaystyle x(t)}$ as ${\displaystyle x_{t}}$ and ${\displaystyle (y(1),y(2),...,y(t))}$ as ${\displaystyle y_{1:t}}$. Computing ${\displaystyle p(x_{t},y_{1:t})}$ directly would require marginalizing over all possible state sequences ${\displaystyle \{x_{1:t-1}\}}$, the number of which grows exponentially with ${\displaystyle t}$. Instead, the forward algorithm takes advantage of the conditional independence rules of the hidden Markov model (HMM) to perform the calculation recursively.

To demonstrate the recursion, let

${\displaystyle \alpha _{t}(x_{t})=p(x_{t},y_{1:t})=\sum _{x_{t-1}}p(x_{t},x_{t-1},y_{1:t})}$.

Using the chain rule to expand ${\displaystyle p(x_{t},x_{t-1},y_{1:t})}$, we can then write

${\displaystyle \alpha _{t}(x_{t})=\sum _{x_{t-1}}p(y_{t}|x_{t},x_{t-1},y_{1:t-1})p(x_{t}|x_{t-1},y_{1:t-1})p(x_{t-1},y_{1:t-1})}$.

Because ${\displaystyle y_{t}}$ is conditionally independent of everything but ${\displaystyle x_{t}}$, and ${\displaystyle x_{t}}$ is conditionally independent of everything but ${\displaystyle x_{t-1}}$, this simplifies to

${\displaystyle \alpha _{t}(x_{t})=p(y_{t}|x_{t})\sum _{x_{t-1}}p(x_{t}|x_{t-1})\alpha _{t-1}(x_{t-1})}$.

Thus, since ${\displaystyle p(y_{t}|x_{t})}$ and ${\displaystyle p(x_{t}|x_{t-1})}$ are given by the model's emission distributions and transition probabilities, one can quickly calculate ${\displaystyle \alpha _{t}(x_{t})}$ from ${\displaystyle \alpha _{t-1}(x_{t-1})}$ and avoid incurring exponential computation time.

The forward algorithm is easily modified to account for observations from variants of the hidden Markov model as well, such as the Markov jump linear system.

In order to take into account future history (i.e., if one wanted to improve the estimate for past times), you can run the backward algorithm, which complements the forward algorithm. This is called smoothing. The forward/backward algorithm computes ${\displaystyle P(x_{k}|y_{1:t})}$ for ${\displaystyle 1<k<t}$. So the full forward/backward algorithm takes into account all evidence.

In order to achieve the most likely sequence, the Viterbi algorithm is required. It computes the most likely state sequence given the history of observations, that is, the state sequence that maximizes ${\displaystyle P(x_{0:t}|y_{0:t})}$.

This example from Roger Boyle's HMM tutorial on observing possible states of weather from the observed condition of seaweed. We have observations of seaweed for three consecutive days as dry, damp, and soggy in order. The possible states of weather can be sunny, cloudy, or rainy. In total, there can be ${\displaystyle 3^{3}=27}$ such weather sequences. Exploring all such possible state sequences is computationally very expensive. To reduce this complexity, Forward algorithm comes in handy, where the trick lies in using the conditional independence of the sequence steps to calculate partial probabilities, ${\displaystyle \alpha _{t}(x_{t})=p(x_{t},y_{1:t})=p(y_{t}|x_{t})\sum _{x_{t-1}}p(x_{t}|x_{t-1})\alpha _{t-1}(x_{t-1})}$ as shown in the above derivation. Hence, we can calculate the probabilities as the product of the appropriate observation/emission probability, ${\displaystyle p(y_{t}|x_{t})}$ ( probability of state ${\displaystyle y_{t}}$ seen at time t from previous observation) with the sum of probabilities of reaching that state at time t, calculated using transition probabilities. This reduces complexity of the problem from searching whole search space to just using previously computed ${\displaystyle \alpha }$'s and transition probabilities.

The forward algorithm is mostly used in applications that need us to determine the probability of being in a specific state when we know about the sequence of observations. We first calculate the probabilities over the states computed for the previous observation and use them for the current observations, and then extend it out for the next step using the transition probability table. The approach basically caches all the intermediate state probabilities so they are computed only once. This helps us to compute a fixed state path. The process is also called posterior decoding. The algorithm computes probability much more efficiently than the naive approach, which very quickly ends up in a combinatorial explosion. Together, they can provide the probability of a given emission/observation at each position in the sequence of observations. It is from this information that a version of the most likely state path is computed ("posterior decoding"). The algorithm can be applied wherever we can train a model as we receive data using Baum-Welch[2] or any general EM algorithm. The Forward algorithm will then tell us about the probability of data with respect to what is expected from our model. One of the applications can be in the domain of Finance, where it can help decide on when to buy or sell tangible assets. It can have applications in all fields where we apply Hidden Markov Models. The popular ones include Natural language processing domains like tagging part-of-speech and speech recognition.[1] Recently it is also being used in the domain of Bioinformatics. Forward algorithm can also be applied to perform Weather speculations. We can have a HMM describing the weather and its relation to the state of observations for few consecutive days (some examples could be dry, damp, soggy, sunny, cloudy, rainy etc.). We can consider calculating the probability of observing any sequence of observations recursively given the HMM. We can then calculate the probability of reaching an intermediate state as the sum of all possible paths to that state. Thus the partial probabilities for the final observation will hold the probability of reaching those states going through all possible paths.

Hybrid Forward Algorithm:[3] A variant of the Forward Algorithm called Hybrid Forward Algorithm (HFA) can be used for the construction of radial basis function (RBF) neural networks with tunable nodes. The RBF neural network is constructed by the conventional subset selection algorithms. The network structure is determined by combining both the stepwise forward network configuration and the continuous RBF parameter optimization. It is used to efficiently and effectively produce a parsimonious RBF neural network that generalizes well. It is achieved through simultaneous network structure determination and parameter optimization on the continuous parameter space. HFA tackles the mixed integer hard problem using an integrated analytic framework, leading to improved network performance and reduced memory usage for the network construction.

Forward Algorithm for Optimal Control in Hybrid Systems:[4] This variant of Forward algorithm is motivated by the structure of manufacturing environments that integrate process and operations control. We derive a new property of the optimal state trajectory structure which holds under a modified condition on the cost function. This allows us to develop a low-complexity, scalable algorithm for explicitly determining the optimal controls, which can be more efficient than Forward Algorithm.

Continuous Forward Algorithm:[5] A continuous forward algorithm (CFA) can be used for nonlinear modelling and identification using radial basis function (RBF) neural networks. The proposed algorithm performs the two tasks of network construction and parameter optimization within an integrated analytic framework, and offers two important advantages. First, the model performance can be significantly improved through continuous parameter optimization. Secondly, the neural representation can be built without generating and storing all candidate regressors, leading to significantly reduced memory usage and computational complexity.

Complexity of Forward Algorithm is ${\displaystyle \theta (nm^{2})}$, where ${\displaystyle m}$ is the number of hidden or latent variables, like weather in the example above, and ${\displaystyle n}$ is the length of the sequence of the observed variable. This is clear reduction from the adhoc method of exploring all the possible states with a complexity of ${\displaystyle \theta (nm^{n})}$.

• Viterbi algorithm
• Forward-backward algorithm

• Russell and Norvig's Artificial Intelligence, a Modern Approach, starting on page 570 of the 2010 edition, provides a succinct exposition of this and related topics
• Smyth, Padhraic, David Heckerman, and Michael I. Jordan. "Probabilistic independence networks for hidden Markov probability models." Neural computation 9.2 (1997): 227-269.
• Read, Jonathon. "Hidden Markov Models and Dynamic Programming." University of Oslo (2011).
• Kohlschein, Christian, An introduction to Hidden Markov Models
• Manganiello, Fabio, Mirco Marchetti, and Michele Colajanni. Multistep attack detection and alert correlation in intrusion detection systems. Information Security and Assurance. Springer Berlin Heidelberg, 2011. 101-110.

• Stratonovich, R. L. "Conditional markov processes". Theory of Probability & Its Applications 5, no. 2 (1960): 156178.
• Lawrence R. Rabiner, B. H. Juang (January 1986). "An introduction to hidden Markov models". IEEE ASSP Magazine: 4–15.

• Roger Boyle, A Tutorial on Hidden Markov Models. 24 April 2016.
• Zhang, Ping, and Christos G. Cassandras. "An improved forward algorithm for optimal control of a class of hybrid systems." Automatic Control, IEEE Transactions on 47.10 (2002): 1735-1739.