AI Chat AI Image Generator AI Video Text to Speech

Near-Optimal Algorithm for Distribution-Free Junta Testing

11/25/2019

∙

by Xiaojin Zhang, et al.

∙

∙

In this paper, We firstly present an algorithm for the problem of distribution-free junta testing for Boolean functions with one-sided error, the query complexity of which is Õ(k/ϵ). This closes the gap between upper bound and lower bound of the query complexity. Further, we present a simpler algorithm with the same query complexity.

page 1

page 2

page 3

page 4

research

∙ 02/13/2018

Distribution-free Junta Testing

We study the problem of testing whether an unknown n-variable Boolean fu...

0 Xi Chen, et al. ∙

research

∙ 11/10/2022

Directed Isoperimetric Theorems for Boolean Functions on the Hypergrid and an O(n√(d)) Monotonicity Tester

The problem of testing monotonicity for Boolean functions on the hypergr...

0 Hadley Black, et al. ∙

research

∙ 04/10/2019

Testing Unateness Nearly Optimally

We present an Õ(n^2/3/ϵ^2)-query algorithm that tests whether an unknown...

0 Xi Chen, et al. ∙

research

∙ 10/25/2021

Parameterized Convexity Testing

In this work, we develop new insights into the fundamental problem of co...

0 Abhiruk Lahiri, et al. ∙

research

∙ 06/09/2021

Strongly Sublinear Algorithms for Testing Pattern Freeness

Given a permutation π:[k] → [k], a function f:[n] →ℝ contains a π-appear...

0 Ilan Newman, et al. ∙

research

∙ 06/15/2020

Improved algorithm for permutation testing

We study the problem of testing forbidden patterns. The patterns that ar...

0 Xiaojin Zhang, et al. ∙

research

∙ 11/19/2018

Testing local properties of arrays

We study testing of local properties in one-dimensional and multi-dimens...

0 Omri Ben-Eliezer, et al. ∙