Multi-task Reinforcement Learning in Reproducing Kernel Hilbert Spaces via Cross-learning

Abstract

Reinforcement learning (RL) is a framework to optimize a control policy using rewards that are revealed by the system as a response to a control action. In its standard form, RL involves a single agent that uses its policy to accomplish a specific task. These methods require large amounts of reward samples to achieve good performance, and may not generalize well when the task is modified, even if the new task is related. In this paper we are interested in a collaborative scheme in which multiple agents with different tasks optimize their policies jointly. To this end, we introduce cross-learning, in which agents tackling related tasks have their policies constrained to be close to one another. Two properties make our new approach attractive: (i) it produces a multi-task central policy that can be used as a starting point to adapt quickly to one of the tasks trained for, in a situation when the agent does not know which task is currently facing, and (ii) as in meta-learning, it adapts to environments related but different to those seen during training. We focus on continuous policies belonging to reproducing kernel Hilbert spaces for which we bound the distance between the task-specific policies and the cross-learned policy. To solve the resulting optimization problem, we resort to a projected policy gradient algorithm and prove that it converges to a near-optimal solution with high probability. We evaluate our methodology with a navigation example in which agents can move through environments with obstacles of multiple shapes and avoid obstacles not trained for.

Multi-task Supervised Learning via Cross-learning

“…However, recent results have shown that even in those cases, problems akin to (PCL) have tractable duality gaps [14], motivating primal-dual approaches. Nonetheless, for the specific case of the cross-learning Algorithm 1, previous results have shown its converge in high probability to a neighborhood of a first-order stationary point of problem (PCL) in the context of reinforcement learning [11].…”

“…In this paper, we take a constrained approach to the multi-task learning problem. Our formulation is based on the cross-learning framework [10,11]. Originally used for learning policies in a reinforcement learning scenario, nevertheless, its principles can be also applied to the multi-task supervised learning problem.…”