新規性探索とエミッタによる疎報酬探索
Sparse Reward Exploration via Novelty Search and Emitters
疎報酬環境で探索と活用を交互に行うSERENEを提案し、新規性探索で探索、エミッタで報酬領域を活用する手法が既存手法より優れることを示した。
著者: Giuseppe Paolo, Alexandre Coninx, Stephane Doncieux, Alban Laflaquière
分類: cs.NE, cs.AI, cs.LG, cs.RO
原文アブストラクト
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 optimization algorithms. A meta-scheduler allocates a global computational budget by alternating between the two processes, ensuring the discovery and efficient exploitation of disjoint reward areas. SERENE returns both a collection of diverse solutions covering the search space and a collection of high-performing solutions for each distinct reward area. We evaluate SERENE on various sparse reward environments and show it compares favorably to existing baselines.
