Junta distance approximation with sub-exponential queries

DOI10.4230/LIPICS.CCC.2021.24MaRDI QIDQ6170389zbMATH OpenOpenAlexFDO

Authors Avishay Tal

Publication date 12 July 2023

Full work available at URL https://arxiv.org/abs/2106.00287

zbMATH Keywords

algorithmscomplexity theoryFourier analysisjuntasnormalized influenceproperty testingtolerant property testing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Abstract: Leveraging tools of De, Mossel, and Neeman [FOCS, 2019], we show two different results pertaining to the emph{tolerant testing} of juntas. Given black-box access to a Boolean function $f:{pm1}^{n}opm1$, we give a $poly(k,frac1varepsilon)$ query algorithm that distinguishes between functions that are $gamma$-close to $k$-juntas and $(gamma+varepsilon)$-far from $k^{\prime }$-juntas, where $k^{\prime }=O(frackvarepsilo{n}^2)$. In the non-relaxed setting, we extend our ideas to give a $2^{ildeO(sqrtk/varepsilon)}$ (adaptive) query algorithm that distinguishes between functions that are $gamma$-close to $k$-juntas and $(gamma+varepsilon)$-far from $k$-juntas. To the best of our knowledge, this is the first subexponential-in-$k$ query algorithm for approximating the distance of $f$ to being a $k$-junta (previous results of Blais, Canonne, Eden, Levi, and Ron [SODA, 2018] and De, Mossel, and Neeman [FOCS, 2019] required exponentially many queries in $k$). Our techniques are Fourier analytical and make use of the notion of "normalized influences" that was introduced by Talagrand [AoP, 1994].

Cited in

(1)

• Let's try to be more tolerant: on tolerant property testing and distance approximation (invited talk)

This page was built for publication: Junta distance approximation with sub-exponential queries

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6170389)