A Unified Framework for Testing Linear-Invariant Properties

There has been a sequence of recent papers devoted to understanding the relation between the testability of properties of Boolean functions and the invariance of the properties with respect to transformations of the domain. Invariance with respect to F_2-linear transformations is arguably the most common such symmetry for natural properties of Boolean functions on the hypercube. Hence, it is an important goal to find necessary and sufficient conditions for testability of linear-invariant properties. This is explicitly posed as an open problem in a recent survey of Sudan. We obtain the following results: 1. We show that every linear-invariant property that can be characterized by forbidding induced solutions to a (possibly infinite) set of linear equations can be tested with one-sided error. 2. We show that every linear-invariant property that can be tested with one-sided error can be characterized by forbidding induced solutions to a (possibly infinite) set of {\em systems} of linear equations. We conjecture that our result from item (1) can be extended to cover systems of linear equations. We further show that the validity of this conjecture would have the following implications: 1. It would imply that every linear-invariant property that is closed under restrictions to linear subspaces is testable with one-sided error. Such a result would unify several previous results on testing Boolean functions, such as the testability of low-degree polynomials and of Fourier dimensionality. 2. It would imply that a linear-invariant property ${\cal P}$ is testable with one-sided error {\bf if and only if} ${\cal P}$ is closed under restrictions to linear subspaces, thus resolving Sudan's problem.

[1]  O. Svensson,et al.  Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling , 2007, FOCS 2007.

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

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

[4]  Carsten Lund,et al.  Nondeterministic exponential time has two-prover interactive protocols , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[5]  Terence Tao,et al.  Testability and repair of hereditary hypergraph properties , 2008, Random Struct. Algorithms.

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

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

[8]  Eli Ben-Sasson,et al.  Some 3CNF properties are hard to test , 2003, STOC '03.

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

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

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

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

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

[14]  Noga Alon,et al.  A characterization of the (natural) graph properties testable with one-sided error , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

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

[16]  Gheorghe Paun,et al.  Current Trends in Theoretical Computer Science: The Challenge of the New Century , 2004 .

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

[18]  Rocco A. Servedio,et al.  Testing for Concise Representations , 2007, 48th Annual IEEE Symposium on Foundations of Computer Science (FOCS'07).

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

[20]  Noga Alon,et al.  A combinatorial characterization of the testable graph properties: it's all about regularity , 2006, STOC '06.

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

[22]  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).

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

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

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

[26]  Simon Litsyn,et al.  Almost orthogonal linear codes are locally testable , 2005, 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS'05).

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

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

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

[30]  Arnab Bhattacharyya,et al.  Separations of Matroid Freeness Properties , 2010, Electron. Colloquium Comput. Complex..

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

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

[33]  E. Szemerédi.  Regular Partitions of Graphs , 1975 .

[34]  Arnab Bhattacharyya,et al.  Lower bounds for testing triangle-freeness in Boolean functions , 2010, SODA '10.

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

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

[37]  Manuel Blum,et al.  Self-testing/correcting with applications to numerical problems , 1990, STOC '90.

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

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

[40]  Eldar Fischer.  The difficulty of testing for isomorphism against a graph that is given in advance , 2004, STOC '04.

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

[42]  Dana Ron,et al.  Property Testing: A Learning Theory Perspective , 2007, COLT.

[43]  Madhu Sudan,et al.  2-Transitivity Is Insufficient for Local Testability , 2008, Computational Complexity Conference.

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

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

[46]  László Lovász,et al.  Graph limits and parameter testing , 2006, STOC '06.

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

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

[49]  Madhu Sudan,et al.  Optimal Testing of Reed-Muller Codes , 2009, 2010 IEEE 51st Annual Symposium on Foundations of Computer Science.

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

[51]  Noga Alon,et al.  Efficient Testing of Large Graphs , 2000, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

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

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

[54]  Eric Vigoda,et al.  Adaptive Simulated Annealing: A Near-optimal Connection between Sampling and Counting , 2007, FOCS.