Self-testing/correcting with applications to numerical problems
Journal of Computer and System Sciences - Special issue: papers from the 22nd ACM symposium on the theory of computing, May 14–16, 1990
Toward Efficient Agnostic Learning
Machine Learning - Special issue on computational learning theory, COLT'92
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Monotonicity testing over general poset domains
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Robust Characterizations of Polynomials withApplications to Program Testing
SIAM Journal on Computing
Improved Testing Algorithms for Monotonicity
RANDOM-APPROX '99 Proceedings of the Third International Workshop on Approximation Algorithms for Combinatorial Optimization Problems: Randomization, Approximation, and Combinatorial Algorithms and Techniques
SIAM Journal on Discrete Mathematics
Better streaming algorithms for clustering problems
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
A sublinear algorithm for weakly approximating edit distance
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Testing that distributions are close
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
On the strength of comparisons in property testing
Information and Computation
Abstract Combinatorial Programs and Efficient Property Testers
SIAM Journal on Computing
Fast approximate PCPs for multidimensional bin-packing problems
Information and Computation
Testing versus estimation of graph properties
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
A Characterization of the (natural) Graph Properties Testable with One-Sided Error
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Tolerant property testing and distance approximation
Journal of Computer and System Sciences
Tolerant locally testable codes
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Information theory in property testing and monotonicity testing in higher dimension
STACS'05 Proceedings of the 22nd annual conference on Theoretical Aspects of Computer Science
Tolerant property testing and distance approximation
Journal of Computer and System Sciences
Approximating the distance to properties in bounded-degree and general sparse graphs
ACM Transactions on Algorithms (TALG)
Property Testing: A Learning Theory Perspective
Foundations and Trends® in Machine Learning
ACM Transactions on Computation Theory (TOCT)
Tolerant Linearity Testing and Locally Testable Codes
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Algorithmic and Analysis Techniques in Property Testing
Foundations and Trends® in Theoretical Computer Science
Approximating the distance to monotonicity in high dimensions
ACM Transactions on Algorithms (TALG)
Distributed discovery of large near-cliques
DISC'09 Proceedings of the 23rd international conference on Distributed computing
Distribution-free testing algorithms for monomials with a sublinear number of queries
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Detecting and exploiting near-sortedness for efficient relational query evaluation
Proceedings of the 14th International Conference on Database Theory
Approximate Satisfiability and Equivalence
SIAM Journal on Computing
Local Monotonicity Reconstruction
SIAM Journal on Computing
A brief introduction to property testing
Property testing
The program of the mini-workshop
Property testing
Property testing
Introduction to testing graph properties
Property testing
Some recent results on local testing of sparse linear codes
Property testing
Local property reconstruction and monotonicity
Property testing
A brief introduction to property testing
Property testing
The program of the mini-workshop
Property testing
Property testing
Introduction to testing graph properties
Property testing
Some recent results on local testing of sparse linear codes
Property testing
Local property reconstruction and monotonicity
Property testing
A brief introduction to property testing
Studies in complexity and cryptography
Introduction to testing graph properties
Studies in complexity and cryptography
Testing odd-cycle-freeness in Boolean functions
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
SIAM Journal on Discrete Mathematics
A o(n) monotonicity tester for boolean functions over the hypercube
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Optimal bounds for monotonicity and lipschitz testing over hypercubes and hypergrids
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |
In this paper we study a generalization of standard property testing where the algorithms are required to be more tolerant with respect to objects that do not have, but are close to having, the property. Specifically, a tolerant property testing algorithm is required to accept objects that are ε1 -close to having a given property P and reject objects that are ε2-far from having P, for some parameters 0 ≤ ε1 2 1. Another related natural extension of standard property testing that we study, is distance approximation. Here the algorithm should output an estimate ε of the distance of the object to P, where this estimate is sufficiently close to the true distance of the object to P. We first formalize the notions of tolerant property testing and distance approximation and discuss the relationship between the two tasks, as well as their relationship to standard property testing. We then apply these new notions to the study of two problems: tolerant testing of clustering and distance approximation for monotonicity. We present and analyze algorithms whose query complexity is either polylogarithmic or independent of the size of the input.