Neural Logic Reinforcement Learning
By Zhengyao Jiang, Shan Luo. 2019
92 citations recorded by the source corpus.
Deep reinforcement learning (DRL) has achieved significant breakthroughs in various tasks. However, most DRL algorithms suffer a problem of generalizing the learned policy which makes the learning performance largely affected even by minor modifications of the training environment. Except that, the use of deep neural networks makes the learned policies hard to be interpretable. To address these two challenges, we propose a novel algorithm named Neural Logic Reinforcement Learning (NLRL) to represent the policies in reinforcement learning by first-order logic. NLRL is based on policy gradient methods and differentiable inductive logic programming that have demonstrated significant advantages in terms of interpretability and generalisability in supervised tasks. Extensive experiments conducted on cliff-walking and blocks manipulation tasks demonstrate that NLRL can induce interpretable policies achieving near-optimal performance while demonstrating good generalisability to environments of different initial states and problem sizes.
Subfields: Artificial Intelligence
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Sriraam Natarajan
- Kristian Kersting
- Ronald E. Parr
- Kaushik Roy
- Srijita Das
- Luc De Raedt
- David Poole
- Mathias Niepert
Citations in the corpus
- Fitted Q-Learning for Relational Domains (2020, methodology): “Finally, Jiang et al. (2019) used symbolic methods with Neural networks by using differentiable ILP which can directly feed in as a differentiable function to Neural networks.”