U Berkeley, Sergey Levine, Aviral Kumar, Justin Fu, George Tucker
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.
In this tutorial article, we aim to provide the reader with the conceptual tools needed to get started on research on offline reinforcement learning algorithms: reinforcement learning algorithms that utilize previously collected data, without additional online data collection. Offline reinforcement learning algorithms hold tremendous promise for making it possible to turn large datasets into powerful decision making engines. Effective offline reinforcement learning methods would be able to extract policies with the maximum possible utility out of the available data, thereby allowing automation of a wide range of decision-making domains, from healthcare and education to robotics. However, the limitations of current algorithms make this difficult. We will aim to provide the reader with an understanding of these challenges, particularly in the context of modern deep reinforcement learning methods, and describe some potential solutions that have been explored in recent work to mitigate these challenges, along with recent applications, and a discussion of perspectives on open problems in the field.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2005.01643")
get_code_for_paper("2005.01643")
have("2005.01643")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2005.01643.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2005.01643)
Connect an agent — have() is free.