Linear time dynamic programming for the exact path of optimal models selected from a finite set.

Toby Hocking Joseph Vargovich

Published in: CoRR (2020)

Keyphrases

dynamic programming
minimum cost
finite number
small number
multiscale
state space
complex systems
genetic algorithm
linear space
statistical models
efficiently computable
cartesian product
average distance
randomly selected
coarse to fine
feature subset
worst case
reinforcement learning
feature selection