Bisimulations for Neural Network Reduction
We present a notion of bisimulation that induces a reduced network which is semantically equivalent to the given neural network. We provide a minimization algorithm to construct the smallest bisimulation equivalent network. Reductions that construct bisimulation equivalent neural networks are limited in the scale of reduction. We present an approximate notion of bisimulation that provides semantic closeness, rather than, semantic equivalence, and quantify semantic deviation between the neural networks that are approximately bisimilar. The latter provides a trade-off between the amount of reduction and deviations in the semantics.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Learning Discrete State Abstractions With Deep Variational Inference
Abstraction is crucial for effective sequential decision making in domains with large state spaces. In this work, we propose an information bottleneck method for learning approximate bisimulations, a type of state abstra…
Decision MakingMulti-Goal Reinforcement LearningReinforcement LearningSequential Decision Making+1Bisimulation Learning
We introduce a data-driven approach to computing finite bisimulations for state transition systems with very large, possibly infinite state space. Our novel technique computes stutter-insensitive bisimulations of determi…
validCoalgebraic Fuzzy geometric logic
The paper aims to develop a framework for coalgebraic fuzzy geometric logic by adding modalities to the language of fuzzy geometric logic. Using the methods of coalgebra, the modal operators are introduced in the languag…
Intuitionistic Linear Temporal Logics
We consider intuitionistic variants of linear temporal logic with `next', `until' and `release' based on expanding posets: partial orders equipped with an order-preserving transition function. This class of structures gi…
A meta-probabilistic-programming language for bisimulation of probabilistic and non-well-founded type systems
We introduce a formal meta-language for probabilistic programming, capable of expressing both programs and the type systems in which they are embedded. We are motivated here by the desire to allow an AGI to learn not onl…
Probabilistic ProgrammingVocal Bursts Type Prediction