Reverse Forward Curriculum Learning for Extreme Sample and Demonstration Efficiency in Reinforcement Learning

Stone Tao, Arth Shukla, Tse-kai Chan, Hao Su
5/6/2024
cs.LGcs.AIcs.RO

No official code found. Best implementation: StoneT2000/rfcl (65 stars, last commit 2024-11-28).

Abstract

Reinforcement learning (RL) presents a promising framework to learn policies through environment interaction, but often requires an infeasible amount of interaction data to solve complex tasks from sparse rewards. One direction includes augmenting RL with offline data demonstrating desired tasks, but past work often require a lot of high-quality demonstration data that is difficult to obtain, especially for domains such as robotics. Our approach consists of a reverse curriculum followed by a forward curriculum. Unique to our approach compared to past work is the ability to efficiently leverage more than one demonstration via a per-demonstration reverse curriculum generated via state resets. The result of our reverse curriculum is an initial policy that performs well on a narrow initial state distribution and helps overcome difficult exploration problems. A forward curriculum is then used to accelerate the training of the initial policy to perform well on the full initial state distribution of the task and improve demonstration and sample efficiency. We show how the combination of a reverse curriculum and forward curriculum in our method, RFCL, enables significant improvements in demonstration and sample efficiency compared against various state-of-the-art learning-from-demonstration baselines, even solving previously unsolvable tasks that require high precision and control.

View on arXivView PDF

Code Implementations(1)

StoneT2000/rfclCommunity100%

(ICLR 2024) Reverse Forward Curriculum Learning

657Shell, PythonOct 25, 20231 years ago
manipulationreinforcement-learningrobotics

Similar Papers

Cite this paper

@article{tao2024reverse,
  title  = {Reverse Forward Curriculum Learning for Extreme Sample and Demonstration Efficiency in Reinforcement Learning},
  author = {Stone Tao and Arth Shukla and Tse-kai Chan and Hao Su},
  year   = {2024},
  eprint = {2405.03379},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2405.03379v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2405.03379.svg)](https://codeofpaper.com/paper/2405.03379)

Discussion