Geometric Path Enumeration

Geometric Path Enumeration for Equivalence Verification of Neural Networks
We present and evaluate an approach for proving equivalence properties on neural networks and show that the verification of $\epsilon$-equivalence is coNP-complete
Samuel Teuber, Marko Kleine Büning, Philipp Kern, Carsten Sinz
PDF Cite Code Experiments DOI / IEEE Xplore
Geometric Path Enumeration for Equivalence Verification of Neural Networks