Erasure-Resilient Property Testing

@article{Dixit2016ErasureResilientPT,
title={Erasure-Resilient Property Testing},
author={Kashyap Dixit and Sofya Raskhodnikova and Abhradeep Thakurta and Nithin M. Varma},
journal={ArXiv},
year={2016},
volume={abs/1607.05786}
}
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… Expand
14 Citations
D S ] 2 0 Ju l 2 01 6 Erasure-Resilient Property Testing ∗
Property testers form an important class of sublinear algorithms. In the standard property testing model, an algorithm accesses the input function f : D 7→ R via an oracle. With very few exceptions,Expand
Sublinear-Time Computation in the Presence of An Online Adversary
We initiate the study of sublinear-time algorithms that access their input via an online adversarial oracle. After answering each query to the input object, such an oracle can erase or corrupt aExpand
Sublinear-Time Computation in the Presence of Online Erasures
• Computer Science
• ArXiv
• 2021
It is shown that two fundamental properties of functions, linearity and quadraticity, can be tested for constant t with asymptotically the same complexity as in the standard property testing model and tight bounds in terms of t are proved. Expand
Erasure-Resilient Sublinear-Time Graph Algorithms
• Computer Science
• Electron. Colloquium Comput. Complex.
• 2020
The erasure-resilient algorithm (for the special case with no erasures) is an improvement over the previously known algorithm for connectedness in the standard property testing model and has optimal dependence on the proximity parameter $\varepsilon$. Expand
Parameterized Property Testing of Functions
• Mathematics, Computer Science
• Electron. Colloquium Comput. Complex.
• 2017
This work parameterizes the query complexity of property testers in terms of the size r of the image of the input function, and obtains testers for monotonicity and convexity of functions of the form f:[n]→ R with query complexity O (log r), with no dependence on n. Expand
C C ] 7 S ep 2 01 9 Hard properties with ( very ) short PCPPs and their applications
We show that there exist properties that are maximally hard for testing, while still admitting PCPPs with a proof size very close to linear. Specifically, for every fixed l, we construct a property PExpand
Optimal Unateness Testers for Real-Valued Functions: Adaptivity Helps
• Computer Science, Mathematics
• ICALP
• 2017
The results establish that adaptivity helps with testing unateness of real-valued functions on domains of the form {0,1}^d and, more generally, [n]^d, in contrast to the situation for monotonicity testing where there is no adaptivity gap. Expand
Isoperimetric Inequalities for Real-Valued Functions with Applications to Monotonicity Testing
• Mathematics, Computer Science
• Electron. Colloquium Comput. Complex.
• 2020
It is shown that the distance to monotonicity of real-valued functions that are $\alpha$-far from monotone can be approximated nonadaptively within a factor of $O(\sqrt{d\log d})$ with query complexity polynomial in $1/\alpha$ and the dimension $d$. Expand
Query complexity lower bounds for local list-decoding and hard-core predicates (even for small rate and huge lists)
• Computer Science
• Electron. Colloquium Comput. Complex.
• 2020
It is shown that black-box proofs cannot improve the Goldreich-Levin theorem and produce a hard-core predicate that is hard to predict with probability 12 + 1 ω(1) when provided with a one-way function f : {0, 1} → { 0, 1}, such that circuits of size poly() cannot invert f with probability ρ = 1/2 √ `. Expand
New Algorithms and Lower Bounds for LIS Estimation
• Mathematics, Computer Science
• ArXiv
• 2020
The two aspects of adaptivity and parameterization in sublinear-time algorithms for LIS estimation are investigated and it is implied that nonadaptive tolerant testing is strictly harder than non Adaptive erasure-resilient testing for the natural property of sortedness. Expand

References

SHOWING 1-10 OF 55 REFERENCES
Erasure-Resilient Property Testing
• Computer Science, Mathematics
• SIAM J. Comput.
• 2018
This work begins a study of property testers that are resilient to the presence of adversarially erased function values and identifies an $\alpha$-erasure-resilient $\var...$ that is resistant to being erased by an adversary. Expand
On proximity oblivious testing
• Computer Science, Mathematics
• STOC '09
• 2009
It is shown that constant-query proximity-oblivious testers do not exist for many easily testable properties, and that even when they exist, repeating them does not necessarily yield the best standard testers for the corresponding property. Expand
On Sample-Based Testers
• Computer Science
• TOCT
• 2016
This work advances the study of sample-based property testers by providing several general positive results as well as by revealing relations between variants of this testing model, and shows that certain types of query-based testers yield sample- based testers of sublinear sample complexity. Expand
Tolerant Testers of Image Properties
• Mathematics, Computer Science
• ICALP
• 2016
This work designs efficient approximation algorithms that approximate the distance to three basic properties of image properties (being a half-plane, convexity, and connectedness) within a small additive error $\epsilon$ and independent of the size of the image. Expand
On the strength of comparisons in property testing
• E. Fischer
• Computer Science, Mathematics
• Inf. Comput.
• 2001
It is proved that an e-test for a property of integer sequences, such as the property of the sequence being a monotone non-decreasing sequence, cannot perform less queries than the best e- test which uses only comparisons between the queried values. Expand
Monotonicity testing over general poset domains
• Mathematics, Computer Science
• STOC '02
• 2002
It is shown that in its most general setting, testing that Boolean functions are close to monotone is equivalent, with respect to the number of required queries, to several other testing problems in logic and graph theory. Expand
Trading Query Complexity for Sample-Based Testing and Multi-testing Scalability
• Computer Science, Mathematics
• 2015 IEEE 56th Annual Symposium on Foundations of Computer Science
• 2015
It is shown that every non-adaptive property testing algorithm making a constant number of queries, over a fixed alphabet, can be converted to a sample-based testing algorithm whose average number of query is a fixed, smaller than 1, power of n. Expand
Property Testing on Product Distributions
• Mathematics, Computer Science
• ACM Trans. Algorithms
• 2017
An optimal dimension reduction theorem for all bounded derivative properties that relates the distance of a function from the property to the Distance of restrictions of the function to random lines is proved. Expand
Testing the Lipschitz Property over Product Distributions with Applications to Data Privacy
• Mathematics, Computer Science
• TCC
• 2013
A computationally efficient algorithm is designed that verifies whether $\cal T}_{priv}$ satisfies differential privacy on typical datasets (DPTD) guarantee in time sublinear in the size of the domain of the datasets. Expand
The Power and Limitations of Uniform Samples in Testing Properties of Figures
• Mathematics, Computer Science
• FSTTCS
• 2016
It is proved that convexity can be tested with $$O({Epsilon }^{-1})$$ queries by testers that can make queries of their choice while uniform testers for this property require $$\varOmega ({\epsilon )^{-5/4}$$ samples. Expand