paper-with-me

Papers

On Neural Network Equivalence Checking using SMT Solvers

2022-03-22 · Charis Eleftheriadis, Nikolaos Kekatos, Panagiotis Katsaros, Stavros Tripakis

Two pretrained neural networks are deemed equivalent if they yield similar outputs for the same inputs. Equivalence checking of neural networks is of great importance, due to its utility in replacing learning-enabled components with equivalent ones, when there is need to fulfill additional requirements or to address security threats, as is the case for example when using knowledge distillation, adversarial training etc. SMT solvers can potentially provide solutions to the problem of neural network equivalence checking that will be sound and complete, but as it is expected any such solution is associated with significant limitations with respect to the size of neural networks to be checked. This work presents a first SMT-based encoding of the equivalence checking problem, explores its utility and limitations and proposes avenues for future research and improvements towards more scalable and practically applicable solutions. We present experimental results that shed light to the aforementioned issues, for diverse types of neural network models (classifiers and regression networks) and equivalence criteria, towards a general and application-independent equivalence checking approach.

📄 PDF Abstract BibTeX arXiv:2203.11629

Code (0)

등록된 구현이 없습니다.

Tasks

Knowledge Distillation

Similar Papers 제목 키워드 기반

Recursive Aggregates as Intensional Functions in Answer Set Programming: Semantics and Strong Equivalence

2024-12-14 · Jorge Fandinno, Zachary Hansen

This paper shows that the semantics of programs with aggregates implemented by the solvers clingo and dlv can be characterized as extended First-Order formulas with intensional functions in the logic of Here-and-There. F…

Annotating Derivations: A New Evaluation Strategy and Dataset for Algebra Word Problems

2016-09-23 · EACL 2017 4 · Shyam Upadhyay, Ming-Wei Chang

We propose a new evaluation for automatic solvers for algebra word problems, which can identify mistakes that existing evaluations overlook. Our proposal is to evaluate such solvers using derivations, which reflect how a…

IB-Net: Initial Branch Network for Variable Decision in Boolean Satisfiability

2024-03-06 · Tsz Ho Chan, Wenyi Xiao, Junhua Huang, HuiLing Zhen 외

Boolean Satisfiability problems are vital components in Electronic Design Automation, particularly within the Logic Equivalence Checking process. Currently, SAT solvers are employed for these problems and neural network …

Estimating the hardness of SAT encodings for Logical Equivalence Checking of Boolean circuits

2022-10-04 · Alexander Semenov, Konstantin Chukharev, Egor Tarasov, Daniil Chivilikhin 외

In this paper we investigate how to estimate the hardness of Boolean satisfiability (SAT) encodings for the Logical Equivalence Checking problem (LEC). Meaningful estimates of hardness are important in cases when a conve…

Strong Equivalence for LPMLN Programs

2019-09-18 · Joohyung Lee, Man Luo

LPMLN is a probabilistic extension of answer set programs with the weight scheme adapted from Markov Logic. We study the concept of strong equivalence in LPMLN, which is a useful mathematical tool for simplifying a part …