TL;DR
SERENE is a novel algorithm that enhances exploration and reward optimization in sparse reward environments by combining novelty search with emitters, effectively discovering diverse solutions and optimizing across disjoint reward areas.
Contribution
It introduces a new approach that separates exploration and exploitation into two processes, improving efficiency in sparse reward settings.
Findings
SERENE outperforms existing baselines in various sparse reward environments.
The algorithm discovers diverse solutions covering the search space.
It effectively exploits multiple reward areas with high performance.
Abstract
Reward-based optimization algorithms require both exploration, to find rewards, and exploitation, to maximize performance. The need for efficient exploration is even more significant in sparse reward settings, in which performance feedback is given sparingly, thus rendering it unsuitable for guiding the search process. In this work, we introduce the SparsE Reward Exploration via Novelty and Emitters (SERENE) algorithm, capable of efficiently exploring a search space, as well as optimizing rewards found in potentially disparate areas. Contrary to existing emitters-based approaches, SERENE separates the search space exploration and reward exploitation into two alternating processes. The first process performs exploration through Novelty Search, a divergent search algorithm. The second one exploits discovered reward areas through emitters, i.e. local instances of population-based…
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.
