Abstract
AbstractBehavioural cloning (BC) is a commonly used imitation learning method to infer a sequential decision-making policy from expert demonstrations. However, when the quality of the data is not optimal, the resulting behavioural policy also performs sub-optimally once deployed. Recently, there has been a surge in offline reinforcement learning methods that hold the promise to extract high-quality policies from sub-optimal historical data. A common approach is to perform regularisation during training, encouraging updates during policy evaluation and/or policy improvement to stay close to the underlying data. In this work, we investigate whether an offline approach to improving the quality of the existing data can lead to improved behavioural policies without any changes in the BC algorithm. The proposed data improvement approach - Model-Based Trajectory Stitching (MBTS) - generates new trajectories (sequences of states and actions) by ‘stitching’ pairs of states that were disconnected in the original data and generating their connecting new action. By construction, these new transitions are guaranteed to be highly plausible according to probabilistic models of the environment, and to improve a state-value function. We demonstrate that the iterative process of replacing old trajectories with new ones incrementally improves the underlying behavioural policy. Extensive experimental results show that significant performance gains can be achieved using MBTS over BC policies extracted from the original data. Furthermore, using the D4RL benchmarking suite, we demonstrate that state-of-the-art results are obtained by combining MBTS with two existing offline learning methodologies reliant on BC, model-based offline planning (MBOP) and policy constraint (TD3+BC).
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Software
Reference74 articles.
1. An, G., Moon, S., Kim, J.-H., & Song, H.O. (2021). Uncertainty-based offline reinforcement learning with diversified q-ensemble. In: Advances in Neural Information Processing Systems 34
2. Argenson, A., & Dulac-Arnold, G.: (2020). Model-based offline planning. arXiv preprint arXiv:2008.05556
3. Arjovsky, M., Chintala, S., & Bottou, L. (2017). Wasserstein generative adversarial networks. In: International Conference on Machine Learning, pp. 214–223 PMLR
4. Bacci, G., Bacci, G., Larsen, K.G., & Mardare, R. (2013). Computing behavioral distances, compositionally. In: International Symposium on Mathematical Foundations of Computer Science, pp. 74–85 . Springer
5. Bacci, G., Bacci, G., Larsen, K.G., & Mardare, R. (2013). On-the-fly exact computation of bisimilarity distances. In: International Conference on Tools and Algorithms for the Construction and Analysis of Systems, pp. 1–15 . Springer
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献