LTL-Based Non-Markovian Inverse Reinforcement Learning
Mohammad Afzal, Sankalp Gambhir, Ashutosh Gupta, Krishna S, Ashutosh, Trivedi, Alvaro Velasquez

TL;DR
This paper introduces a novel inverse reinforcement learning method that learns explainable reward signals in the form of Linear Temporal Logic formulas from expert demonstrations, enhancing interpretability over traditional scalar rewards.
Contribution
The paper presents a new IRL approach using LTL with quantitative semantics, enabling the extraction of simple, interpretable reward formulas from demonstration data.
Findings
Feasibility demonstrated on noisy data
Automated formula discovery for reward signals
Open-source tool QuantLearn developed
Abstract
The successes of reinforcement learning in recent years are underpinned by the characterization of suitable reward functions. However, in settings where such rewards are non-intuitive, difficult to define, or otherwise error-prone in their definition, it is useful to instead learn the reward signal from expert demonstrations. This is the crux of inverse reinforcement learning (IRL). While eliciting learning requirements in the form of scalar reward signals has been shown to effective, such representations lack explainability and lead to opaque learning. We aim to mitigate this situation by presenting a novel IRL method for eliciting declarative learning requirements in the form of a popular formal logic -- Linear Temporal Logic (LTL) -- from a set of traces given by the expert policy. A key novelty of the proposed approach is quantitative semantics of satisfaction of an LTL formula by a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsSemantic Web and Ontologies · Biomedical Text Mining and Ontologies · Rough Sets and Fuzzy Logic
