Discovering and Exploiting Sparse Rewards in a Learned Behavior Space
Giuseppe Paolo, Miranda Coninx, Alban Laflaqui\`ere, and Stephane, Doncieux

TL;DR
STAX is a novel algorithm that autonomously learns a behavior space during exploration, enabling efficient optimization of sparse rewards without prior task-specific knowledge.
Contribution
It introduces a method to learn a behavior space on-the-fly, separating exploration from reward exploitation, reducing the need for prior environment information.
Findings
Performs comparably to existing methods on sparse reward tasks
Requires significantly less prior task knowledge
Effectively learns a low-dimensional behavior representation
Abstract
Learning optimal policies in sparse rewards settings is difficult as the learning agent has little to no feedback on the quality of its actions. In these situations, a good strategy is to focus on exploration, hopefully leading to the discovery of a reward signal to improve on. A learning algorithm capable of dealing with this kind of settings has to be able to (1) explore possible agent behaviors and (2) exploit any possible discovered reward. Efficient exploration algorithms have been proposed that require to define a behavior space, that associates to an agent its resulting behavior in a space that is known to be worth exploring. The need to define this space is a limitation of these algorithms. In this work, we introduce STAX, an algorithm designed to learn a behavior space on-the-fly and to explore it while efficiently optimizing any reward discovered. It does so by separating the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsReinforcement Learning in Robotics · Data Stream Mining Techniques · Advanced Bandit Algorithms Research
