Showing posts with label 02-05. Show all posts
Showing posts with label 02-05. Show all posts

Wednesday, May 2, 2012

Meeting 02-05-2012

Discussion Points

Andreas, Lukas and me presented the results of the experiments (see previous posts for my results). I've got some usefull feedback and comment, which are summarized in the planning below.

Planning

  1. Investigate why the IRTI line horizontal at the end of the Six Hump Camel Back Experiments.
  2. Implement a visualization to show at which time a split occurs (at which sample number). 
  3. Check if it is correct that the RMTL agent has a significant decrease in number of simulations per second when memorization is enabled, as seen in the table of the last post.
  4. Think which parameters are relevant (to mention in the report) and remove the redundant.
  5. Optimize the multi-step agents
  6. Think of a graph representation of the multi-step experiments and rerun them under more difficult settings, i.e. less time or the settings from the paper (with noisy rewards, noisy actions, etc).
  7. Implement perfect recall on meta tree level
  8. Implement Transposition Tree

Feedback 02-05-2012

Multi-step Results

I've ran some experiments regarding the four multi-step algorithms in the CartPole environment:

- I used pretty "easy" settings for the environment (no transition/reward/observation noise, a small but sufficient action space (force applied to the cart), etc.).
- On the other hand, I limited the agent to (only) 100 ms per step.
- The rewards are equal to the number of steps the agent is able to balance the pole.
- Per algorithm, 100 runs were performed.
- Note that I did not improve/profile the agents yet and neither did I tune the parameters in detail. Furthermore, I could only do 100 runs due to time constraints of today's meeting. Therefore, the results have to be considered preliminary.

algorithm  |  reward
<= 100
> 100
> 250
> 500
>= 1000
RMTL
0
0
0
1
99
RSTL
2
2
3
3
90
HOSTL
2
2
3
8
85
HOMTL
0
0
0
0
100

- The next table shows the number of simulations each algorithm can perform in 1 second (roughly; on average) during the first 10 steps in the CartPole environment.

algorithm   |   avg sims/s
Memorization
No memorization
RMTL
37000
39000
RSTL
18000
32000
HOSTL
7300
7700
HOMTL
5000
5000


Thesis Overview