Fourier Growth of Parity Decision Trees

03/22/2021
by   Uma Girish, et al.
0

We prove that for every parity decision tree of depth d on n variables, the sum of absolute values of Fourier coefficients at level ℓ is at most d^ℓ/2· O(ℓ·log(n))^ℓ. Our result is nearly tight for small values of ℓ and extends a previous Fourier bound for standard decision trees by Sherstov, Storozhenko, and Wu (STOC, 2021). As an application of our Fourier bounds, using the results of Bansal and Sinha (STOC, 2021), we show that the k-fold Forrelation problem has (randomized) parity decision tree complexity Ω̃(n^1-1/k), while having quantum query complexity ⌈ k/2⌉. Our proof follows a random-walk approach, analyzing the contribution of a random path in the decision tree to the level-ℓ Fourier expression. To carry the argument, we apply a careful cleanup procedure to the parity decision tree, ensuring that the value of the random walk is bounded with high probability. We observe that step sizes for the level-ℓ walks can be computed by the intermediate values of level ≤ℓ-1 walks, which calls for an inductive argument. Our approach differs from previous proofs of Tal (FOCS, 2020) and Sherstov, Storozhenko, and Wu (STOC, 2021) that relied on decompositions of the tree. In particular, for the special case of standard decision trees we view our proof as slightly simpler and more intuitive. In addition, we prove a similar bound for noisy decision trees of cost at most d – a model that was recently introduced by Ben-David and Blais (FOCS, 2020).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
06/19/2020

When Is Amplification Necessary for Composition in Randomized Query Complexity?

Suppose we have randomized decision trees for an outer function f and an...
research
08/01/2020

On parity decision trees for Fourier-sparse Boolean functions

We study parity decision trees for Boolean functions. The motivation of ...
research
04/27/2020

Classical-Quantum Separations in Certain Classes of Boolean Functions– Analysis using the Parity Decision Trees

In this paper we study the separation between the deterministic (classic...
research
03/06/2022

Improved Quantum Query Upper Bounds Based on Classical Decision Trees

Given a classical query algorithm as a decision tree, when does there ex...
research
01/25/2022

Noise sensitivity from fractional query algorithms and the axis-aligned Laplacian

We introduce the notion of classical fractional query algorithms, which ...
research
07/09/2023

Properly Learning Decision Trees with Queries Is NP-Hard

We prove that it is NP-hard to properly PAC learn decision trees with qu...
research
01/26/2022

Linear Branching Programs and Directional Affine Extractors

A natural model of read-once linear branching programs is a branching pr...

Please sign up or login with your details

Forgot password? Click here to reset