Abstract
We consider different versions of exploration in reinforcement learning. For the test problem, we use navigation in a shortcut maze. It is shown that chaotic ∊-greedy policy may be as efficient as a random one. The best results were obtained with a model chaotic neuron. Therefore, exploration strategy can be implemented in a deterministic learning system such as a neural network.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.