マルチタスク方策の能動的ファインチューニング
Active Fine-Tuning of Multi-Task Policies
限られたデモ予算でマルチタスク方策を効率的に適応させるため、情報利得が最大となるタスクを能動的に選択してデモを収集する手法AMFを提案。
著者: Marco Bagatella, Jonas Hübotter, Georg Martius, Andreas Krause
分類: cs.LG, cs.RO
原文アブストラクト
Pre-trained generalist policies are rapidly gaining relevance in robot learning due to their promise of fast adaptation to novel, in-domain tasks. This adaptation often relies on collecting new demonstrations for a specific task of interest and applying imitation learning algorithms, such as behavioral cloning. However, as soon as several tasks need to be learned, we must decide which tasks should be demonstrated and how often? We study this multi-task problem and explore an interactive framework in which the agent adaptively selects the tasks to be demonstrated. We propose AMF (Active Multi-task Fine-tuning), an algorithm to maximize multi-task policy performance under a limited demonstration budget by collecting demonstrations yielding the largest information gain on the expert policy. We derive performance guarantees for AMF under regularity assumptions and demonstrate its empirical effectiveness to efficiently fine-tune neural policies in complex and high-dimensional environments.
