TL;DR
This paper introduces TRIO, a meta-reinforcement learning algorithm that tracks task non-stationarity over time, enabling fast adaptation without strong assumptions on task evolution, outperforming existing methods.
Contribution
TRIO is a novel meta-RL method that explicitly models and tracks complex, non-Markovian task changes during training and testing, without prior knowledge of task dynamics.
Findings
TRIO outperforms baseline algorithms on simulated non-stationary tasks.
It effectively tracks complex task evolution without assuming Markovian processes.
The method adapts quickly to changing environments, reducing uncertainty over future tasks.
Abstract
Many real-world domains are subject to a structured non-stationarity which affects the agent's goals and the environmental dynamics. Meta-reinforcement learning (RL) has been shown successful for training agents that quickly adapt to related tasks. However, most of the existing meta-RL algorithms for non-stationary domains either make strong assumptions on the task generation process or require sampling from it at training time. In this paper, we propose a novel algorithm (TRIO) that optimizes for the future by explicitly tracking the task evolution through time. At training time, TRIO learns a variational module to quickly identify latent parameters from experience samples. This module is learned jointly with an optimal exploration policy that takes task uncertainty into account. At test time, TRIO tracks the evolution of the latent parameters online, hence reducing the uncertainty…
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.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
