• DOI:10.1109/FOCS.2013.33
• Corpus ID: 5540485

Estimating the Distance from Testable Affine-Invariant Properties

@article{Hatami2013EstimatingTD,
  title={Estimating the Distance from Testable Affine-Invariant Properties},
  author={Hamed Hatami and Shachar Lovett},
  journal={2013 IEEE 54th Annual Symposium on Foundations of Computer Science},
  year={2013},
  pages={237-242}
}

• Hamed Hatami, Shachar Lovett
• Published 3 June 2013
• Mathematics, Computer Science
• 2013 IEEE 54th Annual Symposium on Foundations of Computer Science

Let P be an affine invariant property of multivariate functions over a constant size finite field. We show that if P is locally testable with a constant number of queries, then one can estimate the distance of a function f from P with a constant number of queries. This was previously unknown even for simple properties such as cubic polynomials over the binary field. Our test is simple: take a restriction of f to a constant dimensional affine subspace, and measure its distance from P. We show that by choosing the dimension large enough, this approximates with high probability the global distance of f from P. The analysis combines the approach of Fischer and Newman [SIAM J. Comp 2007] who established a similar result for graph properties, with recently developed tools in higher order Fourier analysis, in particular those developed in Bhattacharyya et al. [STOC 2013].