Tolerant junta testing and the connection to submodular optimization and function isomorphism

DOI10.1145/3337789MaRDI QIDQ5205820zbMATH OpenOpenAlexFDO

Authors Eric Blais, Clement L. Canonne, Talya Eden, Amit Levi, Dana Ron

Publication date 16 December 2019

Published in ACM Transactions on Computation Theory (Search for Journal in Brave)

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

zbMATH Keywords

Boolean functionsfunction isomorphismjuntasproperty testingsubmodular optimizationtolerant testing

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Randomized algorithms (68W20)

Abstract: A function $fcolon{-1,1}^{n}o-1,1$ is a $k$-junta if it depends on at most $k$ of its variables. We consider the problem of tolerant testing of $k$-juntas, where the testing algorithm must accept any function that is $epsilon$-close to some $k$-junta and reject any function that is $epsilo{n}^{\prime }$-far from every $k^{\prime }$-junta for some $epsilo{n}^{\prime }=O(epsilon)$ and $k^{\prime }=O(k)$. Our first result is an algorithm that solves this problem with query complexity polynomial in $k$ and $1/epsilon$. This result is obtained via a new polynomial-time approximation algorithm for submodular function minimization (SFM) under large cardinality constraints, which holds even when only given an approximate oracle access to the function. Our second result considers the case where $k^{\prime }=k$. We show how to obtain a smooth tradeoff between the amount of tolerance and the query complexity in this setting. Specifically, we design an algorithm that given $hoin(0,1/2)$ accepts any function that is $fracepsilonho16$-close to some $k$-junta and rejects any function that is $epsilon$-far from every $k$-junta. The query complexity of the algorithm is $$. Finally, we show how to apply the second result to the problem of tolerant isomorphism testing between two unknown Boolean functions $f$ and $g$. We give an algorithm for this problem whose query complexity only depends on the (unknown) smallest $k$ such that either $f$ or $g$ is close to being a $k$-junta.

Recommendations

• Tolerant junta testing and the connection to submodular optimization and function isomorphism
• Testing juntas nearly optimally
• Nearly tight bounds for testing function isomorphism
• Nearly tight bounds for testing function isomorphism
• Improved Bounds for Testing Juntas

Cited in

(5)

• Tolerant junta testing and the connection to submodular optimization and function isomorphism
• Approximating the distance to monotonicity of Boolean functions
• Sample-based distance-approximation for subsequence-freeness
• Testing versus estimation of graph properties, revisited
• Let's try to be more tolerant: on tolerant property testing and distance approximation (invited talk)

This page was built for publication: Tolerant junta testing and the connection to submodular optimization and function isomorphism

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