Understand
We propose a metalearning approach for learning gradient-based reinforcement learning (RL) algorithms.
- The idea is to evolve a differentiable loss function, such that an agent, which optimizes its policy to minimize this loss, will achieve high rewards.
- The loss is parametrized via temporal convolutions over the agent's experience.
- Because this loss is highly flexible in its ability to take into account the agent's history, it enables fast task learning.
Built on
Nothing clear enough to list yet.
Similar
Nothing clear enough to list yet.
Then
Nothing clear enough to list yet.
Beyond the bibliography
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…