LGAINov 2, 2023

Efficient Symbolic Policy Learning with Differentiable Symbolic Expression

arXiv:2311.02104v112 citationsh-index: 26
Originality Incremental advance
AI Analysis

This work addresses the need for interpretable and deployable policies in RL, particularly for resource-limited settings, though it is incremental as it builds on existing symbolic policy methods.

The paper tackles the problem of learning interpretable and efficient symbolic policies in reinforcement learning by proposing ESPL, a gradient-based method that learns symbolic policies from scratch, achieving higher performance and data efficiency in single-task RL and outperforming neural network policies in meta-RL.

Deep reinforcement learning (DRL) has led to a wide range of advances in sequential decision-making tasks. However, the complexity of neural network policies makes it difficult to understand and deploy with limited computational resources. Currently, employing compact symbolic expressions as symbolic policies is a promising strategy to obtain simple and interpretable policies. Previous symbolic policy methods usually involve complex training processes and pre-trained neural network policies, which are inefficient and limit the application of symbolic policies. In this paper, we propose an efficient gradient-based learning method named Efficient Symbolic Policy Learning (ESPL) that learns the symbolic policy from scratch in an end-to-end way. We introduce a symbolic network as the search space and employ a path selector to find the compact symbolic policy. By doing so we represent the policy with a differentiable symbolic expression and train it in an off-policy manner which further improves the efficiency. In addition, in contrast with previous symbolic policies which only work in single-task RL because of complexity, we expand ESPL on meta-RL to generate symbolic policies for unseen tasks. Experimentally, we show that our approach generates symbolic policies with higher performance and greatly improves data efficiency for single-task RL. In meta-RL, we demonstrate that compared with neural network policies the proposed symbolic policy achieves higher performance and efficiency and shows the potential to be interpretable.

Code Implementations1 repo
Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes