Improved Optimal Testing Results from Global Hypercontractivity
Tali Kaufman, Dor Minzer

TL;DR
This paper improves the query complexity for testing low-degree polynomials over finite fields by reducing the dependency on field size from tower-type to polynomial, using hypercontractivity and structural analysis of erroneous subspaces.
Contribution
It introduces a new approach that achieves polynomial dependence on field size in optimal testing of low-degree polynomials, extending to lifted affine invariant codes.
Findings
Dependency on field size is polynomial rather than tower-type.
Structural analysis of erroneous subspaces via hypercontractivity.
Method applies to lifted affine invariant codes.
Abstract
The problem of testing low-degree polynomials has received significant attention over the years due to its importance in theoretical computer science, and in particular in complexity theory. The problem is specified by three parameters: field size , degree and proximity parameter , and the goal is to design a tester making as few as possible queries to a given function, which is able to distinguish between the case the given function has degree at most , and the case the given function is -far from any degree function. A tester is called optimal if it makes queries (which are known to be necessary). For the field of size , the natural -flat tester was shown to be optimal first by Bhattacharyya et al. for , and later by Haramaty et al. for all prime powers . The dependency on the field size, however, is a tower-type…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
