Skip to content
Kudos AI
enfrar

The Most Likely Sequence

Why the most likely history is not the sequence of individually most likely states, and the Viterbi recursion that finds it by replacing a sum with a maximum.

AdvancedModule 330 min · 120 XP
A trellis of five days with every path drawn faintly, the surviving best path into each node thickening, then the winner traced back from the end.

This is a premium lesson

Sign in and enrol to read the full lesson, run the code, take the quiz, and earn XP toward the path badge.

Sign inCreate account
← Back to Probabilistic Reasoning over Time