Q21Machine Learning

Standard classification algorithms completely assume that every data point is independent. They fail catastrophically on Sequential or Time-Series data (like DNA sequences, Speech Recognition, or Stock Markets) where Data Point 2 is mathematically highly dependent on Data Point 1. The Hidden Markov Model (HMM) is an absolute foundational probabilistic architecture engineered specifically to model sequence dependencies where the true "State" of the system is mathematically invisible to the observer.

An HMM mathematically operates in two completely separate spaces simultaneously:

1. The Hidden States (The Markov Process)

• The system possesses a set of unobservable (Hidden) states (e.g., the actual Weather: Sunny or Rainy).
• It strictly obeys the Markov Assumption: The mathematical probability of transitioning to State $t$ depends ABSOLUTELY ONLY on State $t-1$. The entire rest of history is violently mathematically ignored.
• This is governed by the Transition Matrix ($A$): A 2D matrix detailing the exact probability of jumping from any state to any other state (e.g., $P(\text{Sunny tomorrow}|\text{Rainy today})=0.3$).

2. The Observable Emissions

• Because the true state is hidden, the engineer can only see "Emissions" or "Observations" (e.g., you are locked in a windowless room, you can only observe if your coworker brings an Umbrella or No Umbrella).
• This is governed by the Emission Matrix ($B$): A 2D matrix detailing the exact mathematical probability of generating a specific Observation given a specific Hidden State (e.g., $P(\text{Umbrella}|\text{Rainy})=0.9$).

To execute an HMM, scientists formulated three massive dynamic programming algorithms:

• 1. The Evaluation Problem (The Forward Algorithm): Given an HMM ($A$ and $B$ matrices) and a sequence of observations (e.g., Umbrella, Umbrella, No Umbrella), what is the absolute mathematical probability that this specific HMM generated this sequence?
• 2. The Decoding Problem (The Viterbi Algorithm): The absolute most critical use case. Given a sequence of visible observations (Umbrella, Umbrella, No Umbrella), the Viterbi algorithm executes a highly complex dynamic programming trace to violently deduce the absolute most probable sequence of Hidden States that occurred (e.g., it deduces the weather was actually Rainy, Rainy, Sunny). It mathematically calculates the path of maximum probability through the state space.
• 3. The Learning Problem (The Baum-Welch Algorithm): Given only raw sequences of observations, this algorithm utilizes Expectation-Maximization to mathematically adjust and perfectly optimize the unknown Transition ($A$) and Emission ($B$) matrices.

Real-World Applications

HMMs dominated Speech Recognition (Siri) for decades. The audio waveform is the visible Observation. The actual English words spoken by the human are the Hidden States. The Viterbi algorithm violently calculates the most probable sequence of English words that produced those specific audio waveforms.