Optimal Non-Adaptive Tolerant Junta Testing via Local Estimators

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Nadimpalli, Shivam, Patel, Shyamal
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866916216666324992
author Nadimpalli, Shivam
Patel, Shyamal
author_facet Nadimpalli, Shivam
Patel, Shyamal
contents We give a non-adaptive algorithm that makes $2^{\tilde{O}(\sqrt{k\log(1/\varepsilon_2 - \varepsilon_1)})}$ queries to a Boolean function $f:\{\pm 1\}^n \rightarrow \{\pm 1\}$ and distinguishes between $f$ being $\varepsilon_1$-close to some $k$-junta versus $\varepsilon_2$-far from every $k$-junta. At the heart of our algorithm is a local mean estimation procedure for Boolean functions that may be of independent interest. We complement our upper bound with a matching lower bound, improving a recent lower bound obtained by Chen et al. We thus obtain the first tight bounds for a natural property of Boolean functions in the tolerant testing model.
format Preprint
id arxiv_https___arxiv_org_abs_2404_13502
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Optimal Non-Adaptive Tolerant Junta Testing via Local Estimators
Nadimpalli, Shivam
Patel, Shyamal
Data Structures and Algorithms
We give a non-adaptive algorithm that makes $2^{\tilde{O}(\sqrt{k\log(1/\varepsilon_2 - \varepsilon_1)})}$ queries to a Boolean function $f:\{\pm 1\}^n \rightarrow \{\pm 1\}$ and distinguishes between $f$ being $\varepsilon_1$-close to some $k$-junta versus $\varepsilon_2$-far from every $k$-junta. At the heart of our algorithm is a local mean estimation procedure for Boolean functions that may be of independent interest. We complement our upper bound with a matching lower bound, improving a recent lower bound obtained by Chen et al. We thus obtain the first tight bounds for a natural property of Boolean functions in the tolerant testing model.
title Optimal Non-Adaptive Tolerant Junta Testing via Local Estimators
topic Data Structures and Algorithms
url https://arxiv.org/abs/2404.13502