保守的Q改善:解釈可能な決定木方策のための強化学習
Conservative Q-Improvement: Reinforcement Learning for an Interpretable Decision-Tree Policy
方策全体の割引将来報酬が十分に増える場合のみ決定木を拡張する新アルゴリズムを提案し、従来法と同等以上の性能をより簡潔な木で達成した。
著者: Aaron M. Roth, Nicholay Topin, Pooyan Jamshidi, Manuela Veloso
分類: cs.LG, cs.AI, cs.RO
原文アブストラクト
There is a growing desire in the field of reinforcement learning (and machine learning in general) to move from black-box models toward more "interpretable AI." We improve interpretability of reinforcement learning by increasing the utility of decision tree policies learned via reinforcement learning. These policies consist of a decision tree over the state space, which requires fewer parameters to express than traditional policy representations. Existing methods for creating decision tree policies via reinforcement learning focus on accurately representing an action-value function during training, but this leads to much larger trees than would otherwise be required. To address this shortcoming, we propose a novel algorithm which only increases tree size when the estimated discounted future reward of the overall policy would increase by a sufficient amount. Through evaluation in a simulated environment, we show that its performance is comparable or superior to traditional tree-based approaches and that it yields a more succinct policy. Additionally, we discuss tuning parameters to control the tradeoff between optimizing for smaller tree size or for overall reward.
関連論文
- 意図が読み取りやすい行動のための方策正則化強化学習・解釈性
