Curiosity Driven Exploration of Learned Disentangled Goal Spaces

July 04, 2018 ยท Entered Twilight ยท ๐Ÿ› Conference on Robot Learning

๐ŸŒ… TWILIGHT: Old Age
Predates the code-sharing era โ€” a pioneer of its time

"Last commit was 7.0 years ago (โ‰ฅ5 year threshold)"

Evidence collected by the PWNC Scanner

Repo contents: .gitignore, LICENSE, MANIFEST.in, README.md, latentgoalexplo, mge_efr.py, mge_representation.py, notebooks, results, rpe.py, script_mge_efr.py, script_mge_rep.py, script_rpe.py, setup.py

Authors Adrien Laversanne-Finot, Alexandre Pรฉrรฉ, Pierre-Yves Oudeyer arXiv ID 1807.01521 Category cs.LG: Machine Learning Cross-listed cs.AI, cs.NE, cs.RO, stat.ML Citations 89 Venue Conference on Robot Learning Repository https://github.com/flowersteam/Curiosity_Driven_Goal_Exploration โญ 19 Last Checked 1 month ago
Abstract
Intrinsically motivated goal exploration processes enable agents to autonomously sample goals to explore efficiently complex environments with high-dimensional continuous actions. They have been applied successfully to real world robots to discover repertoires of policies producing a wide diversity of effects. Often these algorithms relied on engineered goal spaces but it was recently shown that one can use deep representation learning algorithms to learn an adequate goal space in simple environments. However, in the case of more complex environments containing multiple objects or distractors, an efficient exploration requires that the structure of the goal space reflects the one of the environment. In this paper we show that using a disentangled goal space leads to better exploration performances than an entangled goal space. We further show that when the representation is disentangled, one can leverage it by sampling goals that maximize learning progress in a modular manner. Finally, we show that the measure of learning progress, used to drive curiosity-driven exploration, can be used simultaneously to discover abstract independently controllable features of the environment.
Community shame:
Not yet rated
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

๐Ÿ“œ Similar Papers

In the same crypt โ€” Machine Learning