Safe Policy Search for Lifelong Reinforcement Learning with Sublinear Regret

Abstract

Lifelong reinforcement learning provides a promising framework for developing versatile agents that can accumulate knowledge over a lifetime of experience and rapidly learn new tasks by building upon prior knowledge. However, current lifelong learning methods exhibit non-vanishing regret as the amount of experience increases and include limitations that can lead to suboptimal or unsafe control policies. To address these issues, we develop a lifelong policy gradient learner that operates in an adversarial set- ting to learn multiple tasks online while enforcing safety constraints on the learned policies. We demonstrate, for the first time, sublinear regret for lifelong policy search, and validate our algorithm on several benchmark dynamical systems and an application to quadrotor control.

References in corpus (2)

• Learning Task Grouping and Overlap in Multi-task Learning
• Sequential Transfer in Multi-armed Bandit with Finite Set of Models

Cited by in corpus (7)

• Barrier-Certified Adaptive Reinforcement Learning with Applications to Brushbot Navigation
• Lifelong Incremental Reinforcement Learning with Online Bayesian Inference
• Adaptive Skills, Adaptive Partitions (ASAP)
• Towards Safe Policy Improvement for Non-Stationary MDPs
• Hierarchical reinforcement learning for efficient exploration and transfer
• Learning Adaptive Display Exposure for Real-Time Advertising
• Is the Rush to Machine Learning Jeopardizing Safety? Results of a Survey