The content presents Parametric-Task MAP-Elites (PT-ME), a new black-box algorithm for continuous multi-task optimization problems. The key ideas are:
PT-ME samples a new task at each iteration, effectively covering the continuous task parameter space over time. This is in contrast to previous multi-task algorithms that only solve a finite set of tasks.
PT-ME uses a new variation operator based on local linear regression to exploit the structure of the multi-task problem and improve performance.
The resulting dense dataset of solutions is then distilled into a function that maps any task parameter to its optimal solution, effectively solving the parametric-task optimization problem.
The authors evaluate PT-ME on two parametric-task optimization toy problems (10-DoF Arm and Archery) and a more realistic robotic problem (Door-Pulling). They show that PT-ME outperforms several baselines, including the deep reinforcement learning algorithm PPO, in terms of both coverage and solution quality.
翻譯成其他語言
從原文內容
arxiv.org
深入探究