Learning event-driven switched linear systems
- URL: http://arxiv.org/abs/2009.12831v1
- Date: Sun, 27 Sep 2020 12:32:40 GMT
- Title: Learning event-driven switched linear systems
- Authors: Atreyee Kundu and Pavithra Prabhakar
- Abstract summary: We propose an automata theoretic learning algorithm for the identification of black-box switched linear systems.
Our algorithm first uses the oracle to obtain the node labels of the system run on a given input sequence of events, and then extends Angluin's (L*)-algorithm to determine the FA that accepts the language of the given FA.
- Score: 7.766921168069532
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We propose an automata theoretic learning algorithm for the identification of
black-box switched linear systems whose switching logics are event-driven. A
switched system is expressed by a deterministic finite automaton (FA) whose
node labels are the subsystem matrices. With information about the dimensions
of the matrices and the set of events, and with access to two oracles, that can
simulate the system on a given input, and provide counter-examples when given
an incorrect hypothesis automaton, we provide an algorithm that outputs the
unknown FA. Our algorithm first uses the oracle to obtain the node labels of
the system run on a given input sequence of events, and then extends Angluin's
\(L^*\)-algorithm to determine the FA that accepts the language of the given
FA. We demonstrate the performance of our learning algorithm on a set of
benchmark examples.
Related papers
- Bisimulation Learning [55.859538562698496]
We compute finite bisimulations of state transition systems with large, possibly infinite state space.
Our technique yields faster verification results than alternative state-of-the-art tools in practice.
arXiv Detail & Related papers (2024-05-24T17:11:27Z) - Unified Functional Hashing in Automatic Machine Learning [58.77232199682271]
We show that large efficiency gains can be obtained by employing a fast unified functional hash.
Our hash is "functional" in that it identifies equivalent candidates even if they were represented or coded differently.
We show dramatic improvements on multiple AutoML domains, including neural architecture search and algorithm discovery.
arXiv Detail & Related papers (2023-02-10T18:50:37Z) - Online Regenerative Learning [0.0]
We study a type of Online Linear Programming (OLP) problem that maximizes the objective function with inputs.
The performance of various algorithms that analyze this type of OLP is well studied when the inputs follow some i.i.d distribution.
arXiv Detail & Related papers (2022-09-18T21:04:56Z) - Large-Scale Sequential Learning for Recommender and Engineering Systems [91.3755431537592]
In this thesis, we focus on the design of an automatic algorithms that provide personalized ranking by adapting to the current conditions.
For the former, we propose novel algorithm called SAROS that take into account both kinds of feedback for learning over the sequence of interactions.
The proposed idea of taking into account the neighbour lines shows statistically significant results in comparison with the initial approach for faults detection in power grid.
arXiv Detail & Related papers (2022-05-13T21:09:41Z) - Efficient Linearizability Checking for Actor-based Systems [0.3157031081861668]
We present our work on linearizability checking in DS2, an integrated framework for specifying, synthesizing, and testing distributed actor systems.
DS2 automatically explores the concurrent schedules that system could arrive at, and it compares observed output of the system to ensure it is equivalent to what the sequential implementation could have produced.
arXiv Detail & Related papers (2021-10-13T00:09:48Z) - Classification of Discrete Dynamical Systems Based on Transients [0.0]
We present a novel classification method applicable to any class of deterministic discrete space and time dynamical systems.
We were able to identify a critical region of behavior that corresponds to a phase transition from ordered behavior to chaos.
Our work can be used to design systems in which complex structures emerge.
arXiv Detail & Related papers (2021-08-03T15:34:01Z) - Online Learning Probabilistic Event Calculus Theories in Answer Set
Programming [70.06301658267125]
Event Recognition (CER) systems detect occurrences in streaming time-stamped datasets using predefined event patterns.
We present a system based on Answer Set Programming (ASP), capable of probabilistic reasoning with complex event patterns in the form of rules weighted in the Event Calculus.
Our results demonstrate the superiority of our novel approach, both terms efficiency and predictive.
arXiv Detail & Related papers (2021-03-31T23:16:29Z) - A Novel Anomaly Detection Algorithm for Hybrid Production Systems based
on Deep Learning and Timed Automata [73.38551379469533]
DAD:DeepAnomalyDetection is a new approach for automatic model learning and anomaly detection in hybrid production systems.
It combines deep learning and timed automata for creating behavioral model from observations.
The algorithm has been applied to few data sets including two from real systems and has shown promising results.
arXiv Detail & Related papers (2020-10-29T08:27:43Z) - Induction and Exploitation of Subgoal Automata for Reinforcement
Learning [75.55324974788475]
We present ISA, an approach for learning and exploiting subgoals in episodic reinforcement learning (RL) tasks.
ISA interleaves reinforcement learning with the induction of a subgoal automaton, an automaton whose edges are labeled by the task's subgoals.
A subgoal automaton also consists of two special states: a state indicating the successful completion of the task, and a state indicating that the task has finished without succeeding.
arXiv Detail & Related papers (2020-09-08T16:42:55Z) - Classification of Complex Systems Based on Transients [0.0]
We present a novel classification method applicable to any class of deterministic discrete space and time dynamical systems.
The method distinguishes between different behaviors of a system's average time before entering a loop.
We use it to classify 2D cellular automata to show that our technique can easily be applied to more complex models of computation.
arXiv Detail & Related papers (2020-08-31T11:47:45Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.