Model-based Offline Imitation Learning with Non-expert Data
원문 초록
Although Behavioral Cloning (BC) in theory suffers compounding errors, its scalability and simplicity still makes it an attractive imitation learning algorithm. In contrast, imitation approaches with adversarial training typically does not share the same problem, but necessitates interactions with the environment. Meanwhile, most imitation learning methods only utilises optimal datasets, which could be significantly more expensive to obtain than its suboptimal counterpart. A question that arises is, can we utilise the suboptimal dataset in a principled manner, which otherwise would have been idle? We propose a scalable model-based offline imitation learning algorithmic framework that leverages datasets collected by both suboptimal and optimal policies, and show that its worst case suboptimality becomes linear in the time horizon with respect to the expert samples. We empirically validate our theoretical results and show that the proposed method \textit{always} outperforms BC in the low data regime on simulated continuous control domains
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Guided Policy Optimization under Partial Observability
Bootstrapped Model Predictive Control
Supervised Fine Tuning on Curated Data is Reinforcement Learning (and can be improved)
Reinforcement Learning via Implicit Imitation Guidance
BEAST: Efficient Tokenization of B-Splines Encoded Action Sequences for Imitation Learning
CLAM: Continuous Latent Action Models for Robot Learning from Unlabeled Demonstrations
토론
이 논문과 연결된 포럼 글이 아직 없습니다.