Lew commited on
Commit
7946c8c
1 Parent(s): 07f4999

Update Readme.md. Add math

Browse files
Files changed (1) hide show
  1. README.md +22 -1
README.md CHANGED
@@ -24,4 +24,25 @@ model-index:
24
  # **Reinforce** Agent playing **Pixelcopter-PLE-v0**
25
  This is a trained model of a **Reinforce** agent playing **Pixelcopter-PLE-v0** .
26
  To learn to use this model and train yours check Unit 4 of the Deep Reinforcement Learning Course: https://huggingface.co/deep-rl-course/unit4/introduction
27
-
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
24
  # **Reinforce** Agent playing **Pixelcopter-PLE-v0**
25
  This is a trained model of a **Reinforce** agent playing **Pixelcopter-PLE-v0** .
26
  To learn to use this model and train yours check Unit 4 of the Deep Reinforcement Learning Course: https://huggingface.co/deep-rl-course/unit4/introduction
27
+
28
+
29
+ # Some math about 'Pixelcopter' training.
30
+ The game is to fly in a passage and avoid blocks. Let we have trained our agent so that the probability to crash at block is _p_ (low enogh, I hope).
31
+ The probability that the copter crashes exactly at _n_-th block is product of probabilities it doesn't crash at previous _(n-1)_ blocks and probability it crashes at current block:
32
+ $$P = {p \cdot (1-p)^{n-1}}$$
33
+ The mathematical expectation of number of the block it crashes at is:
34
+ $$<n> = \sum_{n=1}^\infty{n \cdot p \cdot (1-p)^{n-1}} = \frac{1}{p}$$
35
+ The std is:
36
+ $$std(n) = \sqrt{<n^2>-<n>^2}$$
37
+ $$<n^2> = \sum_{n=1}^\infty{n^2 \cdot p \cdot (1-p)^{n-1}} = \frac{2-p}{p^2}$$
38
+ $$std(n) = \sqrt{\frac{2-p}{p^2}-\left( \frac{1}{p} \right) ^2} = \frac{\sqrt{1-p}}{p}$$
39
+ So difference is:
40
+ $$<n> - std(n) = \frac{1 - \sqrt{1-p}}{p}$$
41
+ As long as
42
+ $$ 0 \le p \le 1 $$
43
+ the following is true:
44
+ $$\sqrt{1-p} \ge 1-p$$
45
+ $$<n> - std(n) = \frac{1 - \sqrt{1-p}}{p} \le \frac{1 - (1-p)}{p} = 1$$
46
+ The scores _s_ in 'Pixelcopter' are the number of blocks passed decreased by 5 (for crash). So the average is lower by 5 and the std is the same. No matter how small _p_ is, our 'least score' is:
47
+ $$ (<n> - 5) - std(n) = <n> - std(n) - 5 \le - 4$$
48
+ But as we use only 10 episodes to calculate statistics and episode duration is limited, we can still achieve the goal, better agent, more chances. But understanding this is disappointing