- Low: It annoys or frustrates me for a moment.
I’ve been running some experiments with a simple multiagent game varying the number of workers using PG algorithm. Here are some tensorboard results with 0 workers, 1 worker, and 7 workers (my laptop only has 8 cpus). The checkpoint frequency is 50 and the number of episodes is 2000 for each run.
The larger the number of workers, the faster the run. It’s not a perfect geometric scale, but 8x workers for 2-3x gain is still good, and like I said this is a very simple environment.
It gets a little bit interesting when I look at how how long it takes for a certain score to be reached. I wish I could share the interactive tensorboard, but I’ll just show a table here, where data is number of seconds for each run (rows) to achieve a score (columns). (I collected the data using the un-smoothed curves.)
+ ------------- + --- + --- + --- + --- +
| workers/score | 200 | 300 | 400 | 450 |
+ ------------- + --- + --- + --- + --- +
| 0 workers | 3 | 4.5 | 7.5 | 10 |
| 1 worker | 4 | 6 | 8 | 13 |
| 7 workers | 1 | 2 | 5.5 | 18 |
+ ------------- + --- + --- + --- + --- +
So in every case, 0 workers hits the score markers faster than 1 worker. 7 workers is faster than 0 workers at first, but at the upper levels of the score, it seriously slows down, taking almost 2x longer to reach 450. This table suggests that there may not really be much gain in increasing the number of workers, which doesn’t seem to make sense. What am I missing?