Approximating the Distance to Monotonicity of Boolean Functions

We design a nonadaptive algorithm that, given a Boolean function f{0,1}^n →{0,1} which is α-far from monotone, makes poly(n, 1/α) queries and returns an estimate that, with high probability, is an O(√(n))-approximation to the distance of f to monotonicity. Furthermore, we show that for any constant κ > 0, approximating the distance to monotonicity up to n^1/2 - κ-factor requires 2^n^κ nonadaptive queries, thereby ruling out a poly(n, 1/α)-query nonadaptive algorithm for such approximations. This answers a question of Seshadhri (Property Testing Review, 2014) for the case of nonadaptive algorithms. Approximating the distance to a property is closely related to tolerantly testing that property. Our lower bound stands in contrast to standard (non-tolerant) testing of monotonicity that can be done nonadaptively with O(√(n) / ε^2) queries. We obtain our lower bound by proving an analogous bound for erasure-resilient testers. An α-erasure-resilient tester for a desired property gets oracle access to a function that has at most an α fraction of values erased. The tester has to accept (with probability at least 2/3) if the erasures can be filled in to ensure that the resulting function has the property and to reject (with probability at least 2/3) if every completion of erasures results in a function that is ε-far from having the property. Our method yields the same lower bounds for unateness and being a k-junta. These lower bounds improve exponentially on the existing lower bounds for these properties.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/20/2023

New Lower Bounds for Adaptive Tolerant Junta Testing

We prove a k^-Ω(log(ε_2 - ε_1)) lower bound for adaptively testing wheth...
research
04/14/2019

Approximating the noise sensitivity of a monotone Boolean function

The noise sensitivity of a Boolean function f: {0,1}^n →{0,1} is one of ...
research
05/03/2021

Lower Bounds on the Time/Memory Tradeoff of Function Inversion

We study time/memory tradeoffs of function inversion: an algorithm, i.e....
research
10/12/2020

New Sublinear Algorithms and Lower Bounds for LIS Estimation

Estimating the length of the longest increasing subsequence (LIS) in an ...
research
06/01/2021

Junta Distance Approximation with Sub-Exponential Queries

Leveraging tools of De, Mossel, and Neeman [FOCS, 2019], we show two dif...
research
10/12/2022

Unitary property testing lower bounds by polynomials

We study unitary property testing, where a quantum algorithm is given qu...
research
09/07/2019

Hard properties with (very) short PCPPs and their applications

We show that there exist properties that are maximally hard for testing,...

Please sign up or login with your details

Forgot password? Click here to reset