Research map / Learning theory and algorithms / Matrix and tensor methods

Decoding Hidden Markov Models Faster Than Viterbi Via Online Matrix-Vector (max, +)-Multiplication

AAAI 2016 · Learning theory and algorithms › Matrix and tensor methods · approach: Structured low-rank learning · 2 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Closest papers by meaning

• Online Markov Decoding: Lower Bounds and Near-Optimal Approximation Algorithms (NeurIPS 2019 · similarity 0.88)
• Inverse Filtering for Hidden Markov Models (NeurIPS 2017 · similarity 0.85)
• Scaling Factorial Hidden Markov Models: Stochastic Variational Inference without Messages (NeurIPS 2016 · similarity 0.85)
• Learning Hidden Markov Models When the Locations of Missing Observations are Unknown (ICML 2023 · similarity 0.85)
• Learning HMMs with Nonparametric Emissions via Spectral Decompositions of Continuous Matrices (NeurIPS 2016 · similarity 0.84)
• Algorithm and Hardness for Dynamic Attention Maintenance in Large Language Models (ICML 2024 · similarity 0.82)