Learning decision trees using the Fourier spectrum
SIAM Journal on Computing
Constant depth circuits, Fourier transform, and learnability
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
An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
Journal of Computer and System Sciences
Free Bits, PCPs, and Nonapproximability---Towards Tight Results
SIAM Journal on Computing
Spectral Analysis of Boolean Functions as a Graph Eigenvalue Problem
IEEE Transactions on Computers
Testing Basic Boolean Formulae
SIAM Journal on Discrete Mathematics
Journal of Computer and System Sciences - Special issue on FOCS 2002
Every monotone graph property is testable
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
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
New Results for Learning Noisy Parities and Halfspaces
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Low-degree tests at large distances
Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Testing for Concise Representations
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Sparse Random Linear Codes are Locally Decodable and Testable
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Algebraic property testing: the role of invariance
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Improved Bounds for Testing Juntas
APPROX '08 / RANDOM '08 Proceedings of the 11th international workshop, APPROX 2008, and 12th international workshop, RANDOM 2008 on Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
SODA '09 Proceedings of the twentieth Annual ACM-SIAM Symposium on Discrete Algorithms
Testability and repair of hereditary hypergraph properties
Random Structures & Algorithms
Linearity testing in characteristic two
IEEE Transactions on Information Theory - Part 1
Testing by implicit learning: a brief survey
Property testing
Invariance in property testing
Property testing
Testing by implicit learning: a brief survey
Property testing
Invariance in property testing
Property testing
Efficient sample extractors for juntas with applications
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Quantum algorithm for the Boolean hidden shift problem
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
A canonical form for testing boolean function properties
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Testing Fourier Dimensionality and Sparsity
SIAM Journal on Computing
Testing odd-cycle-freeness in Boolean functions
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Every locally characterized affine-invariant property is testable
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Gems in decision tree complexity revisited
ACM SIGACT News
| Hi-index | 0.00 |
We present a range of new results for testing properties of Boolean functions that are defined in terms of the Fourier spectrum. Broadly speaking, our results show that the property of a Boolean function having a concise Fourier representation is locally testable. We first give an efficient algorithm for testing whether the Fourier spectrum of a Boolean function is supported in a low-dimensional subspace of ${\mathbb F}_2^n$ (equivalently, for testing whether f is a junta over a small number of parities). We next give an efficient algorithm for testing whether a Boolean function has a sparse Fourier spectrum (small number of nonzero coefficients). In both cases we also prove lower bounds showing that any testing algorithm -- even an adaptive one -- must have query complexity within a polynomial factor of our algorithms, which are nonadaptive. Finally, we give an "implicit learning" algorithm that lets us test any sub-property of Fourier concision. Our technical contributions include new structural results about sparse Boolean functions and new analysis of the pairwise independent hashing of Fourier coefficients from [12].