paper-with-me

홈 › Papers

Enhanced POET: Open-Ended Reinforcement Learning through Unbounded Invention of Learning Challenges and their Solutions

2020-03-19 · ICML 2020 1 · Rui Wang, Joel Lehman, Aditya Rawal, Jiale Zhi, Yulun Li, Jeff Clune, Kenneth O. Stanley

Creating open-ended algorithms, which generate their own never-ending stream of novel and appropriately challenging learning opportunities, could help to automate and accelerate progress in machine learning. A recent step in this direction is the Paired Open-Ended Trailblazer (POET), an algorithm that generates and solves its own challenges, and allows solutions to goal-switch between challenges to avoid local optima. However, the original POET was unable to demonstrate its full creative potential because of limitations of the algorithm itself and because of external issues including a limited problem space and lack of a universal progress measure. Importantly, both limitations pose impediments not only for POET, but for the pursuit of open-endedness in general. Here we introduce and empirically validate two new innovations to the original algorithm, as well as two external innovations designed to help elucidate its full potential. Together, these four advances enable the most open-ended algorithmic demonstration to date. The algorithmic innovations are (1) a domain-general measure of how meaningfully novel new challenges are, enabling the system to potentially create and solve interesting challenges endlessly, and (2) an efficient heuristic for determining when agents should goal-switch from one problem to another (helping open-ended search better scale). Outside the algorithm itself, to enable a more definitive demonstration of open-endedness, we introduce (3) a novel, more flexible way to encode environmental challenges, and (4) a generic measure of the extent to which a system continues to exhibit open-ended innovation. Enhanced POET produces a diverse range of sophisticated behaviors that solve a wide range of environmental challenges, many of which cannot be solved through other means.

📄 PDF Abstract BibTeX arXiv:2003.08536

Code (1)

uber-research/poet 공식 구현

Tasks

Reinforcement LearningReinforcement Learning (RL)

Similar Papers 제목 키워드 기반

Open-Ended Learning Strategies for Learning Complex Locomotion Skills

2022-06-14 · Fangqin Zhou, Joaquin Vanschoren

Teaching robots to learn diverse locomotion skills under complex three-dimensional environmental settings via Reinforcement Learning (RL) is still challenging. It has been shown that training agents in simple settings be…

DiversityReinforcement Learning (RL)

Rewardless Open-Ended Learning (ROEL)

2021-09-29 · Alexander Quessy, Thomas Stuart Richardson

Open-ended learning algorithms aim to automatically generate challenges and solutions to an unending sequence of learning opportunities. In Reinforcement Learning (RL) recent approaches to open-ended learning, such as Pa…

reinforcement-learningReinforcement LearningReinforcement Learning (RL)Unsupervised Reinforcement Learning

LLM-POET: Evolving Complex Environments using Large Language Models

2024-06-07 · Fuma Aki, Riku Ikeda, Takumi Saito, Ciaran Regan 외

Creating systems capable of generating virtually infinite variations of complex and novel behaviour without predetermined goals or limits is a major challenge in the field of AI. This challenge has been addressed through…

Language ModellingLarge Language Model

Augmentative Topology Agents For Open-Ended Learning

2022-10-20 · Muhammad Umair Nasir, Michael Beukman, Steven James, Christopher Wesley Cleghorn

In this work, we tackle the problem of open-ended learning by introducing a method that simultaneously evolves agents and increasingly challenging environments. Unlike previous open-ended approaches that optimize agents …

Paired Open-Ended Trailblazer (POET): Endlessly Generating Increasingly Complex and Diverse Learning Environments and Their Solutions

2019-01-07 · Rui Wang, Joel Lehman, Jeff Clune, Kenneth O. Stanley

While the history of machine learning so far largely encompasses a series of problems posed by researchers and algorithms that learn their solutions, an important question is whether the problems themselves can be genera…