Robust Imitation Learning from Noisy Demonstrations
원문 초록
Robust learning from noisy demonstrations is a practical but highly challenging problem in imitation learning. In this paper, we first theoretically show that robust imitation learning can be achieved by optimizing a classification risk with a symmetric loss. Based on this theoretical finding, we then propose a new imitation learning method that optimizes the classification risk by effectively combining pseudo-labeling with co-training. Unlike existing methods, our method does not require additional labels or strict assumptions about noise distributions. Experimental results on continuous-control benchmarks show that our method is more robust compared to state-of-the-art methods.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Guided Policy Optimization under Partial Observability
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
Sparse-Reg: Improving Sample Complexity in Offline Reinforcement Learning using Sparsity
DR-SAC: Distributionally Robust Soft Actor-Critic for Reinforcement Learning under Uncertainty
토론
이 논문과 연결된 포럼 글이 아직 없습니다.