<?xml version="1.0" encoding="UTF-8"?>
<OAI-PMH xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/ http://www.openarchives.org/OAI/2.0/OAI-PMH.xsd">
  <responseDate>2026-09-10T09:45:03Z</responseDate>
  <request identifier="27782" metadataPrefix="oai_dc" verb="GetRecord">https://drops.dagstuhl.de/oai</request>
  <GetRecord>
    <record>
      <header>
        <identifier>oai:drops-oai.dagstuhl.de:27782</identifier>
        <datestamp>2026-09-09T12:19:38Z</datestamp>
        <setSpec>ddc:004</setSpec>
        <setSpec>open_access</setSpec>
      </header>
      <metadata>
        <oai_dc:dc xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
          <dc:title>Property Testing of Computational Networks</dc:title>
          <dc:creator>Czumaj, Artur</dc:creator>
          <dc:creator>Sohler, Christian</dc:creator>
          <dc:subject>Property Testing</dc:subject>
          <dc:subject>Testing Computational Networks</dc:subject>
          <dc:description>In this paper we initiate the study of 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 2/3) any network that computes a certain function (or a function with a certain property) and reject (with probability at least 2/3) any network that is 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 (ε,δ)-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 with a given property).&#13;
To exemplify our framework, we present a case study involving simple neural Boolean networks with ReLU activation function. As a highlight, we demonstrate that for such networks, any near-constant function is testable in query complexity independent of the network’s size. We also show that a similar result cannot be achieved in a natural generalization of the distribution-free model to our setting, and also in a related vanilla testing model. While the analysis of neural Boolean networks with ReLU activation function is rigorous and technically demanding, we consider it a testament to the robustness of our framework and the depth of our findings.</dc:description>
          <dc:publisher>Schloss Dagstuhl – Leibniz-Zentrum für Informatik</dc:publisher>
          <dc:contributor>Artur Czumaj and Christian Sohler</dc:contributor>
          <dc:date>2026</dc:date>
          <dc:relation>Is Part Of LIPIcs, Volume 392, Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2026)</dc:relation>
          <dc:type>InProceedings</dc:type>
          <dc:type>Text</dc:type>
          <dc:type>doc-type:ResearchArticle</dc:type>
          <dc:type>publishedVersion</dc:type>
          <dc:format>application/pdf</dc:format>
          <dc:identifier>doi:10.4230/LIPIcs.APPROX/RANDOM.2026.65</dc:identifier>
          <dc:identifier>urn:nbn:de:0030-drops-277827</dc:identifier>
          <dc:identifier>https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.APPROX/RANDOM.2026.65</dc:identifier>
          <dc:language>eng</dc:language>
          <dc:rights>https://creativecommons.org/licenses/by/4.0/legalcode</dc:rights>
        </oai_dc:dc>
      </metadata>
    </record>
  </GetRecord>
</OAI-PMH>
