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

Eric Blais, Clément L. Canonne, Talya Eden, Amit Levi, Dana Ron

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The function f :{-1, 1}n → {-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 ϵ-close to some k-junta and reject any function that is ϵ0-far from every k0-junta for some ϵ0 = O( ϵ) and k0 = O(k). Our first result is an algorithm that solves this problem with query complexity polynomial in k and 1/ϵ. This result is obtained via a new polynomialtime 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 k0 = 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 ϵ 2 (0, 1/2) accepts any function that isí 8 -close to some k-junta and rejects any function that is ϵ-far from every k-junta. The query complexity of the algorithm is O( k log k/cp(1- p)ϵ). 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.

Original languageEnglish
Title of host publication29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018
EditorsArtur Czumaj
PublisherAssociation for Computing Machinery
Pages2113-2132
Number of pages20
ISBN (Electronic)9781611975031
DOIs
StatePublished - 2018
Event29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018 - New Orleans, United States
Duration: 7 Jan 201810 Jan 2018

Publication series

NameProceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Conference

Conference29th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2018
Country/TerritoryUnited States
CityNew Orleans
Period7/01/1810/01/18

Fingerprint

Dive into the research topics of 'Tolerant junta testing and the connection to submodular optimization and function isomorphism'. Together they form a unique fingerprint.

Cite this