TL;DR
This paper introduces CMOEA, a novel evolutionary algorithm that simultaneously explores all subtask combinations to solve complex multimodal problems in robotics and maze navigation, outperforming or matching existing methods.
Contribution
The paper presents CMOEA, a new algorithm that avoids subtask ordering by exploring all combinations, and demonstrates its effectiveness over existing algorithms like NSGA-II and Lexicase Selection.
Findings
CMOEA outperforms or matches existing algorithms on multimodal tasks.
Adding a linear combination of objectives improves NSGA-II performance.
CMOEA effectively leverages secondary objectives for state-of-the-art results.
Abstract
An important challenge in reinforcement learning, including evolutionary robotics, is to solve multimodal problems, where agents have to act in qualitatively different ways depending on the circumstances. Because multimodal problems are often too difficult to solve directly, it is helpful to take advantage of staging, where a difficult task is divided into simpler subtasks that can serve as stepping stones for solving the overall problem. Unfortunately, choosing an effective ordering for these subtasks is difficult, and a poor ordering can reduce the speed and performance of the learning process. Here, we provide a thorough introduction and investigation of the Combinatorial Multi-Objective Evolutionary Algorithm (CMOEA), which avoids ordering subtasks by allowing all combinations of subtasks to be explored simultaneously. We compare CMOEA against two algorithms that can similarly…
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
MethodsSPEED: Separable Pyramidal Pooling EncodEr-Decoder for Real-Time Monocular Depth Estimation on Low-Resource Settings
