2019
Online Markov Decoding: Lower Bounds and Near-Optimal Approximation Algorithms
NeurIPS 2019poster
We resolve the fundamental problem of online decoding with general nth order ergodic Markov chain models. Specifically, we provide deterministic and randomized algorithms whose performance is close to that of the optimal offline algorithm even when latency is small. Our algorithms admit efficient im…