flâneur — a map of the web's best reading

When Should We Prefer Offline Reinforcement Learning Over Behavioral Cloning? | HTML5

ar5iv.labs.arxiv.org · 26,260 words · saved by 1 readers

Offline reinforcement learning (RL) algorithms can acquire effective policies by utilizing previously collected experience, without any online interaction. It is widely understood that offline RL is able to extract good policies even from highly suboptimal data, a scenario where imitation learning finds suboptimal solutions that do not improve over the demonstrator that generated the dataset. However, another common use case for practitioners is to learn from data that resembles demonstrations. In this case, one can choose to apply offline RL, but can also use behavioral cloning (BC) algorithms, which mimic a subset of the dataset via supervised learning. Therefore, it seems natural to ask: when can an offline RL method outperform BC with an equal amount of expert data, even when BC is a natural choice? To answer this question, we characterize the properties of environments that allow offline RL methods to perform better than BC methods, even when only provided with expert data. Additi

[2204.05618] When Should We Prefer Offline Reinforcement Learning Over Behavioral Cloning? When Should We Prefer Offline Reinforcement Learning Over Behavioral Cloning? ​​Aviral Kumar ∗,1,2 , Joey Hong ∗,1 , Anikait Singh 1 , Sergey Levine 1,2 1 Department of EECS, UC Berkeley 2 Google Research ( ∗ Equal Contribution) {aviralk, joey_hong}@berkeley.edu Abstract Offline reinforcement learning (RL) algorithms can acquire effective policies by utilizing previously collected experience, without any online interaction. It is widely understood that offline RL is able to extract good policies even fro

Explore this link on the map →

related reading