Transfer of Temporal Logic Formulas in Reinforcement Learning
Zhe Xu, Ufuk Topcu

TL;DR
This paper introduces a method for transferring knowledge in reinforcement learning tasks involving temporal logic, significantly improving learning efficiency by leveraging logical formulas and timed automata to transfer policies between similar tasks.
Contribution
It develops a novel transfer learning approach using metric interval temporal logic and timed automata to transfer policies between similar temporal tasks in reinforcement learning.
Findings
Sampling efficiency improved up to tenfold
Transfer of extended Q-functions enhances learning
Method effective in case studies with similar tasks
Abstract
Transferring high-level knowledge from a source task to a target task is an effective way to expedite reinforcement learning (RL). For example, propositional logic and first-order logic have been used as representations of such knowledge. We study the transfer of knowledge between tasks in which the timing of the events matters. We call such tasks temporal tasks. We concretize similarity between temporal tasks through a notion of logical transferability, and develop a transfer learning approach between different yet similar temporal tasks. We first propose an inference technique to extract metric interval temporal logic (MITL) formulas in sequential disjunctive normal form from labeled trajectories collected in RL of the two tasks. If logical transferability is identified through this inference, we construct a timed automaton for each sequential conjunctive subformula of the inferred…
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
TopicsFormal Methods in Verification · Machine Learning and Algorithms · Logic, programming, and type systems
