Learning Interpretable Temporal Properties from Positive Examples Only

09/06/2022
by   Rajarshi Roy, et al.
0

We consider the problem of explaining the temporal behavior of black-box systems using human-interpretable models. To this end, based on recent research trends, we rely on the fundamental yet interpretable models of deterministic finite automata (DFAs) and linear temporal logic (LTL) formulas. In contrast to most existing works for learning DFAs and LTL formulas, we rely on only positive examples. Our motivation is that negative examples are generally difficult to observe, in particular, from black-box systems. To learn meaningful models from positive examples only, we design algorithms that rely on conciseness and language minimality of models as regularizers. To this end, our algorithms adopt two approaches: a symbolic and a counterexample-guided one. While the symbolic approach exploits an efficient encoding of language minimality as a constraint satisfaction problem, the counterexample-guided one relies on generating suitable negative examples to prune the search. Both the approaches provide us with effective algorithms with theoretical guarantees on the learned models. To assess the effectiveness of our algorithms, we evaluate all of them on synthetic data.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/02/2022

Learning Temporal Logic Properties: an Overview of Two Recent Methods

Learning linear temporal logic (LTL) formulas from examples labeled as p...
research
02/10/2020

Learning Interpretable Models in the Property Specification Language

We address the problem of learning human-interpretable descriptions of a...
research
07/28/2021

Learning User-Interpretable Descriptions of Black-Box AI System Capabilities

Several approaches have been developed to answer specific questions that...
research
04/30/2021

Learning Linear Temporal Properties from Noisy Data: A MaxSAT Approach

We address the problem of inferring descriptions of system behavior usin...
research
06/05/2021

Extracting Weighted Automata for Approximate Minimization in Language Modelling

In this paper we study the approximate minimization problem for language...
research
11/10/2020

Inferring Symbolic Automata

We study the learnability of symbolic finite state automata, a model sho...
research
12/11/2019

Neural-Symbolic Descriptive Action Model from Images: The Search for STRIPS

Recent work on Neural-Symbolic systems that learn the discrete planning ...

Please sign up or login with your details

Forgot password? Click here to reset