October 2019
Intermediate to advanced
366 pages
12h 4m
English
All the following code is located inside a function called DAgger, which takes some hyperparameters that we'll see throughout the code as arguments.
The learner's computational graph is simple as its only goal is to build a classifier. In our case, there are only two actions to predict, one for doing nothing, and the other to make the bird flap its wings. We can instantiate two placeholders, one for the input state, and one for the ground-truth actions that are those of the expert. The actions are an integer corresponding to the action taken. In the case of two possible actions, they are just 0 (do nothing) or 1 (fly).
The steps to build such a computational graph are the following:
Read now
Unlock full access