Home /Research /Efficient experience reuse in non-Markovian environments
LEARNING

Efficient experience reuse in non-Markovian environments

Le Tien Dung, Takashi Komeda, Motoki Takagi

Year
2008
Citations
6

Abstract

Learning time is always a critical issue in Reinforcement Learning, especially when Recurrent Neural Networks are used to predict Q values in non-Markovian environments. Experience reuse has been received much attention due to its ability to reduce learning time. In this paper, we propose a new method to efficiently reuse experience. Our method generates new episodes from recorded episodes using an action-pair merger. Recorded episodes and new episodes are replayed after each learning epoch. We compare our method with standard online learning, and learning using experience replay in a vision based robot problem. The results show the potential of this approach.

Keywords

ReuseComputer scienceReinforcement learningAction (physics)Artificial intelligenceMarkov decision processRobotMarkov processMachine learningEngineering

Related papers

Browse all LEARNING papers