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

11/17/2022
āˆ™
by   Dor Minzer, et al.
āˆ™
0
āˆ™

The Cube versus Cube test is a variant of the well-known Plane versus Plane test of Raz and Safra, in which to each 3-dimensional affine subspace C of š”½_q^n, a polynomial of degree at most d, T(C), is assigned in a somewhat locally consistent manner: taking two cubes C_1, C_2 that intersect in a plane uniformly at random, the probability that T(C_1) and T(C_2) agree on C_1āˆ© C_2 is at least some Ļµ. An element of interest is the soundness threshold of this test, i.e. the smallest value of Ļµ, such that this amount of local consistency implies a global structure; namely, that there is a global degree d function g such that g|_Cā‰” T(C) for at least Ī©(Ļµ) fraction of the cubes. We show that the cube versus cube low degree test has soundness poly(d)/q. This result achieves the optimal dependence on q for soundness in low degree testing and improves upon previous soundness results of poly(d)/q^1/2 due to Bhangale, Dinur and Navon.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
āˆ™ 03/13/2021

Fooling Gaussian PTFs via Local Hyperconcentration

We give a pseudorandom generator that fools degree-d polynomial threshol...
research
āˆ™ 09/14/2021

Open Problems Related to Quantum Query Complexity

I offer a case that quantum query complexity still has loads of enticing...
research
āˆ™ 10/02/2020

Improved Submodular Secretary Problem with Shortlists

First, for the for the submodular k-secretary problem with shortlists [1...
research
āˆ™ 06/23/2020

Robust Gaussian Covariance Estimation in Nearly-Matrix Multiplication Time

Robust covariance estimation is the following, well-studied problem in h...
research
āˆ™ 06/21/2023

Probabilistic estimation of the algebraic degree of Boolean functions

The algebraic degree is an important parameter of Boolean functions used...
research
āˆ™ 02/17/2022

Improved Optimal Testing Results from Global Hypercontractivity

The problem of testing low-degree polynomials has received significant a...
research
āˆ™ 09/04/2022

The Approximate Degree of DNF and CNF Formulas

The approximate degree of a Boolean function f{0,1}^nā†’{0,1} is the minim...

Please sign up or login with your details

Forgot password? Click here to reset