In the book "Reinforcement Learning: An Introduction" (2018) Sutton and Barto explain, on page 221, a form of tile coding using hashing, to reduce memory consumption.

I have two questions about that:

  1. How can this approach reduce memory consumption? Doesn't it just depend on the number of tiles (you have to store one weight for each tile)?

  2. They state that there is only a "little loss of performance". In my understanding, the sense of tile coding (and coarse coding) is, that near-by states have many tiles in common and far-away states have only few tilings in common. With tilings "randomly spread throughout the state space" this isn't the case. How does this not influence performance?

  • $\begingroup$ you can look at the implementation here $\endgroup$ – Brale May 22 '19 at 8:47
  • $\begingroup$ I already saw the implementation and understand the concept, but not why it works! $\endgroup$ – F.M.F. May 22 '19 at 13:20

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.