2000 character limit reached
Bisimulations for Neural Network Reduction
Published 7 Oct 2021 in cs.LG and cs.FL | (2110.03726v2)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper.