Bisimulations for Neural Network Reduction

2Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

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.

Cite

CITATION STYLE

APA

Prabhakar, P. (2022). Bisimulations for Neural Network Reduction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 13182 LNCS, pp. 285–300). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-94583-1_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free