Improved Optimal Testing Results from Global Hypercontractivity

02/17/2022
by   Tali Kaufman, et al.
0

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 q, degree d 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 d, and the case the given function is δ-far from any degree d function. A tester is called optimal if it makes O(q^d+1/δ) queries (which are known to be necessary). For the field of size q, the natural t-flat tester was shown to be optimal first by Bhattacharyya et al. for q=2, and later by Haramaty et al. for all prime powers q. The dependency on the field size, however, is a tower-type function. We improve the results above, showing that the dependency on the field size is polynomial. Our approach also applies in the more general setting of lifted affine invariant codes, and is based on studying the structure of the collection of erroneous subspaces. i.e. subspaces A such that f|_A has degree greater than d. Towards this end, we observe that these sets are poorly expanding in the affine version of the Grassmann graph and use that to establish structural results on them via global hypercontractivity. We then use this structure to perform local correction on f.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/12/2023

Optimal Testing of Generalized Reed-Muller Codes in Fewer Queries

A local tester for an error correcting code C⊆Σ^n is a tester that makes...
research
11/29/2020

Erasure-Resilient Sublinear-Time Graph Algorithms

We investigate sublinear-time algorithms that take partially erased grap...
research
09/18/2017

Local decoding and testing of polynomials over grids

The well-known DeMillo-Lipton-Schwartz-Zippel lemma says that n-variate ...
research
08/29/2023

Adversarial Low Degree Testing

In the t-online-erasure model in property testing, an adversary is allow...
research
03/18/2023

MSR codes with linear field size and smallest sub-packetization for any number of helper nodes

The sub-packetization ℓ and the field size q are of paramount importance...
research
05/08/2023

Low-Degree Testing Over Grids

We study the question of local testability of low (constant) degree func...
research
11/17/2022

Approaching the Soundness Barrier: A Near Optimal Analysis of the Cube versus Cube Test

The Cube versus Cube test is a variant of the well-known Plane versus Pl...

Please sign up or login with your details

Forgot password? Click here to reset