A unified framework for testing linear-invariant properties

In the study of property testing, a particularly important role has been played by linear invariant properties, i.e., properties of Boolean functions on the hypercube which are closed under linear transformations of the domain. Examples of such properties include linearity, Reed-Muller codes, and Fourier sparsity. In this work, we describe a framework that can lead to a unified analysis of the testability of all linear-invariant properties, drawing on techniques from additive combinatorics and from graph theory.

[1]  Noga Alon,et al.  A Characterization of the (Natural) Graph Properties Testable with One-Sided Error , 2008, SIAM J. Comput..

[2]  Dana Ron,et al.  Testing Basic Boolean Formulae , 2002, SIAM J. Discret. Math..

[3]  Eli Ben-Sasson,et al.  Limits on the Rate of Locally Testable Affine-Invariant Codes , 2011, APPROX-RANDOM.

[4]  Alex Samorodnitsky,et al.  Low-degree tests at large distances , 2006, STOC '07.

[5]  D. Král,et al.  A removal lemma for systems of linear equations over finite fields , 2008, 0809.1846.

[6]  Ilias Diakonikolas,et al.  Testing for Concise Representations , 2007, FOCS 2007.

[7]  Carsten Lund,et al.  Non-deterministic exponential time has two-prover interactive protocols , 1992, computational complexity.

[8]  Dana Ron.  Property Testing: A Learning Theory Perspective , 2008, Found. Trends Mach. Learn..

[9]  Madhu Sudan,et al.  Optimal Testing of Reed-Muller Codes , 2010, FOCS.

[10]  Eric Blais.  Testing juntas nearly optimally , 2009, STOC '09.

[11]  Eli Ben-Sasson,et al.  Some 3CNF Properties Are Hard to Test , 2005, SIAM J. Comput..

[12]  Madhu Sudan,et al.  Succinct Representation of Codes with Applications to Testing , 2012, SIAM J. Discret. Math..

[13]  Vojtech Rödl,et al.  Generalizations of the removal lemma , 2009, Comb..

[14]  Henry Cohn.  Projective Geometry over 픽1 and the Gaussian Binomial Coefficients , 2004, Am. Math. Mon..

[15]  Ronitt Rubinfeld,et al.  Robust Characterizations of Polynomials with Applications to Program Testing , 1996, SIAM J. Comput..

[16]  Elena Grigorescu,et al.  Tight Lower Bounds for Testing Linear Isomorphism , 2013, APPROX-RANDOM.

[17]  Shubhangi Saraf,et al.  Tolerant Linearity Testing and Locally Testable Codes , 2009, APPROX-RANDOM.

[18]  Ronitt Rubinfeld,et al.  Sublinear Time Algorithms , 2011, SIAM J. Discret. Math..

[19]  Madhu Sudan,et al.  Algebraic property testing: the role of invariance , 2008, Electron. Colloquium Comput. Complex..

[20]  Madhu Sudan.  Invariance in Property Testing , 2010, Electron. Colloquium Comput. Complex..

[21]  Noga Alon,et al.  A Combinatorial Characterization of the Testable Graph Properties: It's All About Regularity , 2009 .

[22]  Guy Kindler,et al.  Testing juntas , 2002, J. Comput. Syst. Sci..

[23]  Shachar Lovett,et al.  Every locally characterized affine-invariant property is testable , 2013, STOC '13.

[24]  E. Fischer.  THE ART OF UNINFORMED DECISIONS: A PRIMER TO PROPERTY TESTING , 2004 .

[25]  Yuichi Yoshida,et al.  Partially Symmetric Functions Are Efficiently Isomorphism-Testable , 2012, 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science.

[26]  Noga Alon,et al.  A separation theorem in property testing , 2008, Comb..

[27]  Terence Tao,et al.  Testability and repair of hereditary hypergraph properties , 2010 .

[28]  Eldar Fischer.  The Difficulty of Testing for Isomorphism against a Graph That Is Given in Advance , 2005, SIAM J. Comput..

[29]  B. Green.  A Szemerédi-type regularity lemma in abelian groups, with applications , 2003, math/0310476.

[30]  Rocco A. Servedio,et al.  Testing Fourier Dimensionality and Sparsity , 2009, SIAM J. Comput..

[31]  Vojtech Rödl,et al.  The Ramsey number of a graph with bounded maximum degree , 1983, J. Comb. Theory, Ser. B.

[32]  Daniel Král,et al.  A combinatorial proof of the Removal Lemma for Groups , 2008, J. Comb. Theory, Ser. A.

[33]  W. T. Gowers,et al.  A new proof of Szemerédi's theorem , 2001 .

[34]  Madhu Sudan,et al.  Testing Linear-Invariant Non-Linear Properties , 2011, Theory Comput..

[35]  Noga Alon,et al.  Efficient Testing of Large Graphs , 2000, Comb..

[36]  Madhu Sudan,et al.  Sparse Random Linear Codes are Locally Decodable and Testable , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

[37]  Ryan O'Donnell,et al.  Lower Bounds for Testing Function Isomorphism , 2010, 2010 IEEE 25th Annual Conference on Computational Complexity.

[38]  Noga Alon,et al.  Nearly tight bounds for testing function isomorphism , 2011, SODA '11.

[39]  Asaf Shapira.  Green's conjecture and testing linear-invariant properties , 2009, STOC '09.

[40]  Ben Green,et al.  An Arithmetic Regularity Lemma, An Associated Counting Lemma, and Applications , 2010, 1002.2028.

[41]  Luca Trevisan,et al.  Three Theorems regarding Testing Graph Properties , 2001, Electron. Colloquium Comput. Complex..

[42]  Shachar Lovett,et al.  Testing Low Complexity Affine-Invariant Properties , 2013, SODA.

[43]  Yuichi Yoshida,et al.  Testing Linear-Invariant Function Isomorphism , 2013, ICALP.

[44]  Madhu Sudan,et al.  2-Transitivity is Insufficient for Local Testability , 2008, 2008 23rd Annual IEEE Conference on Computational Complexity.

[45]  Noga Alon,et al.  Testing Boolean Function Isomorphism , 2010, APPROX-RANDOM.

[46]  B. Szegedy.  The symmetry preserving removal lemma , 2008, 0809.2626.

[47]  Noga Alon,et al.  Testing Reed-Muller codes , 2005, IEEE Transactions on Information Theory.

[48]  Dana Ron,et al.  Property testing and its connection to learning and approximation , 1998, JACM.

[49]  Asaf Shapira,et al.  A Unified Framework for Testing Linear-Invariant Properties , 2010, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

[50]  Rocco A. Servedio,et al.  Testing Halfspaces , 2007, SIAM J. Comput..

[51]  Ben Green,et al.  Linear equations in primes , 2006, math/0606088.

[52]  Eldar Fischer,et al.  Junto-Symmetric Functions, Hypergraph Isomorphism and Crunching , 2012, 2012 IEEE 27th Conference on Computational Complexity.