Improving Viterbi is Hard: Better Runtimes Imply Faster Clique Algorithms.
Arturs BackursChristos TzamosPublished in: ICML (2017)
Keyphrases
- learning algorithm
- recently developed
- orders of magnitude
- computational complexity
- special case
- optimization problems
- beam search
- computationally hard
- data mining
- frequently occurring
- combinatorial optimization
- computational efficiency
- machine learning algorithms
- computationally efficient
- np complete
- significant improvement
- data structure