Chelsea Finn, Aditi Raghunathan, Percy Liang, Evan Liu
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
The goal of meta-reinforcement learning (meta-RL) is to build agents that can quickly learn new tasks by leveraging prior experience on related tasks. Learning a new task often requires both exploring to gather task-relevant information and exploiting this information to solve the task. In principle, optimal exploration and exploitation can be learned end-to-end by simply maximizing task performance. However, such meta-RL approaches struggle with local optima due to a chicken-and-egg problem: learning to explore requires good exploitation to gauge the exploration's utility, but learning to exploit requires information gathered via exploration. Optimizing separate objectives for exploration and exploitation can avoid this problem, but prior meta-RL exploration objectives yield suboptimal policies that gather information irrelevant to the task. We alleviate both concerns by constructing an exploitation objective that automatically identifies taskrelevant information and an exploration objective to recover only this information. This avoids local optima in end-to-end training, without sacrificing optimal exploration. Empirically, DREAM substantially outperforms existing approaches on complex meta-RL problems, such as sparsereward 3D visual navigation. Videos of DREAM: https://ezliu.github.io/dream/
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2008.02790")
get_code_for_paper("2008.02790")
have("2008.02790")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2008.02790.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2008.02790)
Connect an agent — have() is free.