Saved in:
| Main Authors: | , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2506.05294 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866914110564728832 |
|---|---|
| author | Jain, Arnav Kumar Mohta, Vibhakar Kim, Subin Bhardwaj, Atiksh Ren, Juntao Feng, Yunhai Choudhury, Sanjiban Swamy, Gokul |
| author_facet | Jain, Arnav Kumar Mohta, Vibhakar Kim, Subin Bhardwaj, Atiksh Ren, Juntao Feng, Yunhai Choudhury, Sanjiban Swamy, Gokul |
| contents | The fundamental limitation of the behavioral cloning (BC) approach to imitation learning is that it only teaches an agent what the expert did at states the expert visited. This means that when a BC agent makes a mistake which takes them out of the support of the demonstrations, they often don't know how to recover from it. In this sense, BC is akin to giving the agent the fish -- giving them dense supervision across a narrow set of states -- rather than teaching them to fish: to be able to reason independently about achieving the expert's outcome even when faced with unseen situations at test-time. In response, we explore learning to search (L2S) from expert demonstrations, i.e. learning the components required to, at test time, plan to match expert outcomes, even after making a mistake. These include (1) a world model and (2) a reward model. We carefully ablate the set of algorithmic and design decisions required to combine these and other components for stable and sample/interaction-efficient learning of recovery behavior without additional human corrections. Across a dozen visual manipulation tasks from three benchmarks, our approach SAILOR consistently out-performs state-of-the-art Diffusion Policies trained via BC on the same data. Furthermore, scaling up the amount of demonstrations used for BC by 5-10x still leaves a performance gap. We find that SAILOR can identify nuanced failures and is robust to reward hacking. Our code is available at https://github.com/arnavkj1995/SAILOR . |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_05294 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | A Smooth Sea Never Made a Skilled SAILOR: Robust Imitation via Learning to Search Jain, Arnav Kumar Mohta, Vibhakar Kim, Subin Bhardwaj, Atiksh Ren, Juntao Feng, Yunhai Choudhury, Sanjiban Swamy, Gokul Machine Learning The fundamental limitation of the behavioral cloning (BC) approach to imitation learning is that it only teaches an agent what the expert did at states the expert visited. This means that when a BC agent makes a mistake which takes them out of the support of the demonstrations, they often don't know how to recover from it. In this sense, BC is akin to giving the agent the fish -- giving them dense supervision across a narrow set of states -- rather than teaching them to fish: to be able to reason independently about achieving the expert's outcome even when faced with unseen situations at test-time. In response, we explore learning to search (L2S) from expert demonstrations, i.e. learning the components required to, at test time, plan to match expert outcomes, even after making a mistake. These include (1) a world model and (2) a reward model. We carefully ablate the set of algorithmic and design decisions required to combine these and other components for stable and sample/interaction-efficient learning of recovery behavior without additional human corrections. Across a dozen visual manipulation tasks from three benchmarks, our approach SAILOR consistently out-performs state-of-the-art Diffusion Policies trained via BC on the same data. Furthermore, scaling up the amount of demonstrations used for BC by 5-10x still leaves a performance gap. We find that SAILOR can identify nuanced failures and is robust to reward hacking. Our code is available at https://github.com/arnavkj1995/SAILOR . |
| title | A Smooth Sea Never Made a Skilled SAILOR: Robust Imitation via Learning to Search |
| topic | Machine Learning |
| url | https://arxiv.org/abs/2506.05294 |