Approximate Bisimulation Relations for Neural Networks and Application to Assured Neural Network Compression
원문 초록
In this paper, we propose a concept of approximate bisimulation relation for feedforward neural networks. In the framework of approximate bisimulation relation, a novel neural network merging method is developed to compute the approximate bisimulation error between two neural networks based on reachability analysis of neural networks. The developed method is able to quantitatively measure the distance between the outputs of two neural networks with the same inputs. Then, we apply the approximate bisimulation relation results to perform neural networks model reduction and compute the compression precision, i.e., assured neural networks compression. At last, using the assured neural network compression, we accelerate the verification processes of ACAS Xu neural networks to illustrate the effectiveness and advantages of our proposed approximate bisimulation approach.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Enhancing Homophily-Heterophily Separation: Relation-Aware Learning in Heterogeneous Graphs
Chaining Event Spans for Temporal Relation Grounding
A MISMATCHED Benchmark for Scientific Natural Language Inference
MonkeyOCR: Document Parsing with a Structure-Recognition-Relation Triplet Paradigm
Comparative Analysis of AI Agent Architectures for Entity Relationship Classification
Towards a More Generalized Approach in Open Relation Extraction
토론
이 논문과 연결된 포럼 글이 아직 없습니다.