Property Testing of Computational Networks
Artur Czumaj, Christian Sohler

TL;DR
This paper introduces a framework for property testing of weighted computational networks, focusing on neural Boolean networks with ReLU activation, and demonstrates size-independent testability for near constant functions.
Contribution
It develops a novel property testing framework for computational networks and provides the first results on size-independent testability for certain neural network properties.
Findings
Near constant functions are testable with query complexity independent of network size.
The framework applies to neural Boolean networks with ReLU activation.
Size-independent testing is not possible in certain natural generalizations.
Abstract
In this paper we initiate the study of \emph{property testing of weighted computational networks viewed as computational devices}. Our goal is to design property testing algorithms that for a given computational network with oracle access to the weights of the network, accept (with probability at least ) any network that computes a certain function (or a function with a certain property) and reject (with probability at least ) any network that is \emph{far} from computing the function (or any function with the given property). We parameterize the notion of being far and want to reject networks that are \emph{-far}, which means that one needs to change an -fraction of the description of the network to obtain a network that computes a function that differs in at most a -fraction of inputs from the desired function (or any function…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsComplexity and Algorithms in Graphs · Bayesian Modeling and Causal Inference · Stochastic Gradient Optimization Techniques
