Evolving Hierarchical Memory-Prediction Machines in Multi-Task Reinforcement Learning
Stephen Kelly, Tatiana Voegerl, Wolfgang Banzhaf, Cedric Gondro

TL;DR
This paper presents a method using genetic programming to evolve hierarchical memory-based agents capable of multi-task reinforcement learning without explicit task identifiers, demonstrating success across diverse environments.
Contribution
It introduces a novel approach that evolves hierarchical memory structures enabling agents to generalize across multiple tasks without task-specific inputs.
Findings
Hierarchical memory structures improve multi-task learning performance.
Evolved agents perform competitively with task-specific agents.
Dynamic complexity allows efficient real-time operation.
Abstract
A fundamental aspect of behaviour is the ability to encode salient features of experience in memory and use these memories, in combination with current sensory information, to predict the best action for each situation such that long-term objectives are maximized. The world is highly dynamic, and behavioural agents must generalize across a variety of environments and objectives over time. This scenario can be modeled as a partially-observable multi-task reinforcement learning problem. We use genetic programming to evolve highly-generalized agents capable of operating in six unique environments from the control literature, including OpenAI's entire Classic Control suite. This requires the agent to support discrete and continuous actions simultaneously. No task-identification sensor inputs are provided, thus agents must identify tasks from the dynamics of state variables alone and define…
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.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
