Data-driven abstractions via adaptive refinements and a Kantorovich metric [extended version]
We introduce an adaptive refinement procedure for smart, and scalable abstraction of dynamical systems. Our technique relies on partitioning the state space depending on the observation of future outputs. However, this knowledge is dynamically constructed in an adaptive, asymmetric way. In order to learn the optimal structure, we define a Kantorovich-inspired metric between Markov chains, and we use it as a loss function. Our technique is prone to data-driven frameworks, but not restricted to. We also study properties of the above mentioned metric between Markov chains, which we believe could be of application for wider purpose. We propose an algorithm to approximate it, and we show that our method yields a much better computational complexity than using classical linear programming techniques.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Data-driven memory-dependent abstractions of dynamical systems via a Cantor-Kantorovich metric
Abstractions of dynamical systems enable their verification and the design of feedback controllers using simpler, usually discrete, models. In this paper, we propose a data-driven abstraction mechanism based on a novel m…
Quasi-optimal $hp$-finite element refinements towards singularities via deep neural network prediction
We show how to construct the deep neural network (DNN) expert to predict quasi-optimal $hp$-refinements for a given computational problem. The main idea is to train the DNN expert during executing the self-adaptive $hp$-…
On the Use of the Kantorovich-Rubinstein Distance for Dimensionality Reduction
The goal of this thesis is to study the use of the Kantorovich-Rubinstein distance as to build a descriptor of sample complexity in classification problems. The idea is to use the fact that the Kantorovich-Rubinstein dis…
Dimensionality ReductionCounterexample Guided Abstraction Refinement with Non-Refined Abstractions for Multi-Agent Path Finding
Counterexample guided abstraction refinement (CEGAR) represents a powerful symbolic technique for various tasks such as model checking and reachability analysis. Recently, CEGAR combined with Boolean satisfiability (SAT)…
Multi-Agent Path FindingNavigateData-driven Construction of Finite Abstractions for Interconnected Systems: A Compositional Approach
Finite-state abstractions (a.k.a. symbolic models) present a promising avenue for the formal verification and synthesis of controllers in continuous-space control systems. These abstractions provide simplified models tha…