REVIEW 1 cited by
Solving Compositional Reinforcement Learning Problems via Task Reduction
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
We propose a novel learning paradigm, Self-Imitation via Reduction (SIR), for solving compositional reinforcement learning problems. SIR is based on two core ideas: task reduction and self-imitation. Task reduction tackles a hard-to-solve task by actively reducing it to an easier task whose solution is known by the RL agent. Once the original hard task is successfully solved by task reduction, the agent naturally obtains a self-generated solution trajectory to imitate. By continuously collecting and imitating such demonstrations, the agent is able to progressively expand the solved subspace in the entire task space. Experiment results show that SIR can significantly accelerate and improve learning on a variety of challenging sparse-reward continuous-control problems with compositional structures. Code and videos are available at https://sites.google.com/view/sir-compositional.
Forward citations
Cited by 1 Pith paper
-
Umbrella Reinforcement Learning -- computationally efficient tool for hard non-linear problems
Umbrella RL adds an ensemble-entropy bonus to policy gradient to solve sparse-reward, trap-heavy RL tasks, and reports large gains over PPO, RND, iLQR, and value iteration on two toy benchmarks.
Discussion (0). Continue with ORCID to comment.