Erasure-resilient property testing

Kashyap Dixit, Sofya Raskhodnikova, Abhradeep Thakurta, Nithin Varma

Research output: Chapter in Book/Report/Conference proceedingConference contribution

4 Scopus citations


Property testers form an important class of sublinear algorithms. In the standard property testing model, an algorithm accesses the input function f : D → R via an oracle. With very few exceptions, all property testers studied in this model rely on the oracle to provide function values at all queried domain points. However, in many realistic situations, the oracle may be unable to reveal the function values at some domain points due to privacy concerns, or when some of the values get erased by mistake or by an adversary. The testers do not learn anything useful about the property by querying those erased points. Moreover, the knowledge of a tester may enable an adversary to erase some of the values so as to increase the query complexity of the tester arbitrarily or, in some cases, make the tester entirely useless. In this work, we initiate a study of property testers that are resilient to the presence of adversarially erased function values. An α-erasure-resilient ϵ-tester is given parameters α, ϵ ∈ (0, 1), along with oracle access to a function f such that at most an α fraction of function values have been erased. The tester does not know whether a value is erased until it queries the corresponding domain point. The tester has to accept with high probability if there is a way to assign values to the erased points such that the resulting function satisfies the desired property P. It has to reject with high probability if, for every assignment of values to the erased points, the resulting function has to be changed in at least an ϵ-fraction of the non-erased domain points to satisfy P. We design erasure-resilient property testers for a large class of properties. For some properties, it is possible to obtain erasure-resilient testers by simply using standard testers as a black box. However, there are more challenging properties for which all known testers rely on querying a specific point. If this point is erased, all these testers break. We give efficient erasure-resilient testers for several important classes of such properties of functions including monotonicity, the Lipschitz property, and convexity. Finally, we show a separation between the standard testing and erasure-resilient testing. Specifically, we describe a property that can be ϵ-tested with O(1/ϵ) queries in the standard model, whereas testing it in the erasure-resilient model requires number of queries polynomial in the input size.

Original languageEnglish (US)
Title of host publication43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016
EditorsYuval Rabani, Ioannis Chatzigiannakis, Davide Sangiorgi, Michael Mitzenmacher
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959770132
StatePublished - Aug 1 2016
Event43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016 - Rome, Italy
Duration: Jul 12 2016Jul 15 2016

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
ISSN (Print)1868-8969


Other43rd International Colloquium on Automata, Languages, and Programming, ICALP 2016

All Science Journal Classification (ASJC) codes

  • Software


Dive into the research topics of 'Erasure-resilient property testing'. Together they form a unique fingerprint.

Cite this