dynamic-programming

Q-Learning

. ~-learning (Watkins, 1989) is a simpleway for agentsto learn how to act optimallyin controlledMarkovian domains. It amounts to an incremental method for dynamic programming which imposes limited computational demands. It works by successivelyimprovingits evaluationsof the quali...

Sound Value Iteration

. Computing reachability probabilities is at the heart of prob- abilistic model checking. All model checkers compute these probabilities in an iterative fashion using value iteration. This technique approximates a xed point from below by determining reachability probabilities for...