December 2018
Beginner to intermediate
684 pages
21h 9m
English
ε-greedy is a simple policy that ensures the exploration of new actions in a given state while also exploiting the learning experience randomized the selection of actions. An ε-greedy policy selects an action randomly with a probability of ε, and the best action according to the value function otherwise.