Almost Optimal Distribution-free Junta Testing

01/01/2019
by   Nader H. Bshouty, et al.
0

We consider the problem of testing whether an unknown n-variable Boolean function is a k-junta in the distribution-free property testing model, where the distance between function is measured with respect to an arbitrary and unknown probability distribution over {0,1}^n. Chen, Liu, Servedio, Sheng and Xie showed that the distribution-free k-junta testing can be performed, with one-sided error, by an adaptive algorithm that makes Õ(k^2)/ϵ queries. In this paper, we give a simple two-sided error adaptive algorithm that makes Õ(k/ϵ) queries.

READ FULL TEXT

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...
research
08/19/2017

Boolean Unateness Testing with O(n^3/4) Adaptive Queries

We give an adaptive algorithm which tests whether an unknown Boolean fun...
research
06/08/2020

An Optimal Tester for k-Linear

A Boolean function f:{0,1}^n→{0,1} is k-linear if it returns the sum (ov...
research
08/30/2023

Support Testing in the Huge Object Model

The Huge Object model is a distribution testing model in which we are gi...
research
06/09/2021

Strongly Sublinear Algorithms for Testing Pattern Freeness

Given a permutation π:[k] → [k], a function f:[n] →ℝ contains a π-appear...
research
05/02/2023

Sample-based distance-approximation for subsequence-freeness

In this work, we study the problem of approximating the distance to subs...
research
04/18/2022

Low Degree Testing over the Reals

We study the problem of testing whether a function f: ℝ^n →ℝ is a polyno...

Please sign up or login with your details

Forgot password? Click here to reset