Communications of the ACM
Information Processing Letters
A deterministic algorithm for sparse multivariate polynomial interpolation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Interpolating polynomials from their values
Journal of Symbolic Computation - Special issue on computational algebraic complexity
COLT '90 Proceedings of the third annual workshop on Computational learning theory
Fast parallel algorithms for sparse multivariate polynomial interpolation over finite fields
SIAM Journal on Computing
Checking computations in polylogarithmic time
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Self-testing/correcting for polynomials and for approximate functions
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Interpolation and approximation of sparse multivariate polynomials over GF(2)
SIAM Journal on Computing
On zero-testing and interpolation of k -sparse multivariate polynomials over finite fields
Theoretical Computer Science
Can finite samples detect singularities of real-valued functions?
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
On learning ring-sum-expansions
SIAM Journal on Computing
On probably correct classification of concepts
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
Efficient checking of polynomials and proofs and the hardness of approximation problems
Efficient checking of polynomials and proofs and the hardness of approximation problems
Active Learning Using Arbitrary Binary Valued Queries
Machine Learning
Cryptographic limitations on learning Boolean formulae and finite automata
Journal of the ACM (JACM)
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
The algorithmic aspects of the regularity lemma
Journal of Algorithms
Journal of the ACM (JACM)
Toward Efficient Agnostic Learning
Machine Learning - Special issue on computational learning theory, COLT'92
Learning in the presence of finitely or infinitely many irrelevant attributes
Journal of Computer and System Sciences
Randomized Interpolation and Approximationof Sparse Polynomials
SIAM Journal on Computing
Probably Almost Discriminative Learning
Machine Learning
Learning sparse multivariate polynomials over a field with queries and counterexamples
Journal of Computer and System Sciences
On learning multivariate polynomials under the uniform distribution
Information Processing Letters
Improved low-degree testing and its applications
STOC '97 Proceedings of the twenty-ninth annual ACM symposium on Theory of computing
An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
Journal of Computer and System Sciences
Probabilistic checking of proofs: a new characterization of NP
Journal of the ACM (JACM)
Property testing and its connection to learning and approximation
Journal of the ACM (JACM)
More efficient PAC-learning of DNF with membership queries under the uniform distribution
COLT '99 Proceedings of the twelfth annual conference on Computational learning theory
Learning functions represented as multiplicity automata
Journal of the ACM (JACM)
Journal of Computer and System Sciences - 30th annual ACM symposium on theory of computing
Sublinear time approximate clustering
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Testing problems with sublearning sample complexity
Journal of Computer and System Sciences
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
Regular Languages are Testable with a Constant Number of Queries
SIAM Journal on Computing
Simple Learning Algorithms for Decision Trees and Multivariate Polynomials
SIAM Journal on Computing
Testing Membership in Languages that Have Small Width Branching Programs
SIAM Journal on Computing
Testing Basic Boolean Formulae
SIAM Journal on Discrete Mathematics
SIAM Journal on Discrete Mathematics
Testing the diameter of graphs
Random Structures & Algorithms
Testing properties of directed graphs: acyclicity and connectivity
Random Structures & Algorithms
Machine Learning
Machine Learning
A Lower Bound for Testing 3-Colorability in Bounded-Degree Graphs
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
Efficient Testing of Hypergraphs
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Probabilistic algorithms for sparse polynomials
EUROSAM '79 Proceedings of the International Symposiumon on Symbolic and Algebraic Computation
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
Optimal Attribute-Efficient Learning of Disjunction, Parity and Threshold Functions
EuroCOLT '97 Proceedings of the Third European Conference on Computational Learning Theory
Testing subgraphs in large graphs
Random Structures & Algorithms - Special issue: Proceedings of the tenth international conference "Random structures and algorithms"
SIAM Journal on Discrete Mathematics
A sublinear algorithm for weakly approximating edit distance
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
On Learning Monotone Boolean Functions
FOCS '98 Proceedings of the 39th Annual Symposium on Foundations of Computer Science
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A Sublinear Time Approximation Scheme for Clustering in Metric Spaces
FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
Testing that distributions are close
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Functions that have read-once branching programs of quadratic size are not necessarily testable
Information Processing Letters
Journal of Algorithms
Testing Random Variables for Independence and Identity
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Some improvements to total degree tests
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Three theorems regarding testing graph properties
Random Structures & Algorithms
On Testing Convexity and Submodularity
SIAM Journal on Computing
On the strength of comparisons in property testing
Information and Computation
Functions that have read-twice constant width branching programs are not necessarily testable
Random Structures & Algorithms
Sublinear algorithms for testing monotone and unimodal distributions
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Derandomizing homomorphism testing in general groups
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
Lower Bounds for Testing Bipartiteness in Dense Graphs
CCC '04 Proceedings of the 19th IEEE Annual Conference on Computational Complexity
A lower bound for testing juntas
Information Processing Letters
Journal of Computer and System Sciences - Special issue on FOCS 2002
Tight Bounds for Testing Bipartiteness in General Graphs
SIAM Journal on Computing
Testing Low-Degree Polynomials over Prime Fields
FOCS '04 Proceedings of the 45th Annual IEEE Symposium on Foundations of Computer Science
Testing subgraphs in directed graphs
Journal of Computer and System Sciences - Special issue: STOC 2003
Learning functions of k relevant variables
Journal of Computer and System Sciences - Special issue: STOC 2003
Abstract Combinatorial Programs and Efficient Property Testers
SIAM Journal on Computing
Fast approximate PCPs for multidimensional bin-packing problems
Information and Computation
Every monotone graph property is testable
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Testing hypergraph colorability
Theoretical Computer Science - Automata, languages and programming
The Difficulty of Testing for Isomorphism against a Graph That Is Given in Advance
SIAM Journal on Computing
Testing graphs for colorability properties
Random Structures & Algorithms
Some 3CNF Properties Are Hard to Test
SIAM Journal on Computing
The Complexity of Approximating the Entropy
SIAM Journal on 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
Testing triangle-freeness in general graphs
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
A combinatorial characterization of the testable graph properties: it's all about regularity
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Graph limits and parameter testing
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Tolerant property testing and distance approximation
Journal of Computer and System Sciences
A Characterization of Easily Testable Induced Subgraphs
Combinatorics, Probability and Computing
Information theory in property testing and monotonicity testing in higher dimension
Information and Computation
Testing Polynomials over General Fields
SIAM Journal on Computing
Testing k-wise and almost k-wise independence
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Testing versus Estimation of Graph Properties
SIAM Journal on Computing
Efficient Testing of Bipartite Graphs for Forbidden Induced Subgraphs
SIAM Journal on Computing
Testing for Concise Representations
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements Problem
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Testing Expansion in Bounded-Degree Graphs
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Approximate Hypergraph Partitioning and Applications
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Comparing the strength of query types in property testing: the case of testing k-colorability
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Distribution-Free Property-Testing
SIAM Journal on Computing
Testing symmetric properties of distributions
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Efficiently Testing Sparse GF(2) Polynomials
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
On optimal learning algorithms for multiplicity automata
COLT'06 Proceedings of the 19th annual conference on Learning Theory
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
A lower bound for distribution-free monotonicity testing
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
Property testing and the branching program size of boolean functions
FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Distance approximation in bounded-degree and general sparse graphs
APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation
Linearity testing in characteristic two
IEEE Transactions on Information Theory - Part 1
IEEE Transactions on Information Theory
Algorithmic and Analysis Techniques in Property Testing
Foundations and Trends® in Theoretical Computer Science
A local decision test for sparse polynomials
Information Processing Letters
Testing Boolean function isomorphism
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
On testing computability by small width OBDDs
APPROX/RANDOM'10 Proceedings of the 13th international conference on Approximation, and 14 the International conference on Randomization, and combinatorial optimization: algorithms and techniques
Sorting and selection on dynamic data
Theoretical Computer Science
A brief introduction to property testing
Property testing
Hierarchy theorems for property testing
Property testing
Algorithmic aspects of property testing in the dense graphs model
Property testing
A brief introduction to property testing
Property testing
Hierarchy theorems for property testing
Property testing
Algorithmic aspects of property testing in the dense graphs model
Property testing
Untestable properties in the kahr-moore-wang class
WoLLIC'11 Proceedings of the 18th international conference on Logic, language, information and computation
Proximity oblivious testing and the role of invariances
Studies in complexity and cryptography
A brief introduction to property testing
Studies in complexity and cryptography
Proximity oblivious testing and the role of invariances
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Testing Eulerianity and connectivity in directed sparse graphs
Theoretical Computer Science
Algorithmic Aspects of Property Testing in the Dense Graphs Model
SIAM Journal on Computing
On Proximity-Oblivious Testing
SIAM Journal on Computing
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Learning k-modal distributions via testing
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Testing computability by width-two OBDDs
Theoretical Computer Science
Some results on approximate 1-median selection in metric spaces
Theoretical Computer Science
Approximating and testing k-histogram distributions in sub-linear time
PODS '12 Proceedings of the 31st symposium on Principles of Database Systems
Testable and untestable classes of first-order formulae
Journal of Computer and System Sciences
Proceedings of the 18th ACM SIGKDD international conference on Knowledge discovery and data mining
SIAM Journal on Discrete Mathematics
SWAT'12 Proceedings of the 13th Scandinavian conference on Algorithm Theory
Partial tests, universal tests and decomposability
Proceedings of the 5th conference on Innovations in theoretical computer science
Hi-index | 0.00 |
Property testing deals with tasks where the goal is to distinguish between the case that an object (e.g., function or graph) has a prespecified property (e.g., the function is linear or the graph is bipartite) and the case that it differs significantly from any such object. The task should be performed by observing only a very small part of the object, in particular by querying the object, and the algorithm is allowed a small failure probability. One view of property testing is as a relaxation of learning the object (obtaining an approximate representation of the object). Thus property testing algorithms can serve as a preliminary step to learning. That is, they can be applied in order to select, very efficiently, what hypothesis class to use for learning. This survey takes the learning-theory point of view and focuses on results for testing properties of functions that are of interest to the learning theory community. In particular, we cover results for testing algebraic properties of functions such as linearity, testing properties defined by concise representations, such as having a small DNF representation, and more.