スパースカーネル表現による合成可能な強化学習
Composable Learning with Sparse Kernel Representations
正規化アドバンテージ関数で方策を構造化し、追加学習なしで複数の学習済みモデルを合成できるスパースカーネル強化学習を提案し、障害物回避方策の合成と実機転移で有効性を示した。
著者: Ekaterina Tolstaya, Ethan Stump, Alec Koppel, Alejandro Ribeiro
分類: cs.RO, cs.LG
原文アブストラクト
We present a reinforcement learning algorithm for learning sparse non-parametric controllers in a Reproducing Kernel Hilbert Space. We improve the sample complexity of this approach by imposing a structure of the state-action function through a normalized advantage function (NAF). This representation of the policy enables efficiently composing multiple learned models without additional training samples or interaction with the environment. We demonstrate the performance of this algorithm on learning obstacle-avoidance policies in multiple simulations of a robot equipped with a laser scanner while navigating in a 2D environment. We apply the composition operation to various policy combinations and test them to show that the composed policies retain the performance of their components. We also transfer the composed policy directly to a physical platform operating in an arena with obstacles in order to demonstrate a degree of generalization.
