Testing Unateness Nearly Optimally

04/10/2019
by   Xi Chen, et al.
0

We present an Õ(n^2/3/ϵ^2)-query algorithm that tests whether an unknown Boolean function f{0,1}^n→{0,1} is unate (i.e., every variable is either non-decreasing or non-increasing) or ϵ-far from unate. The upper bound is nearly optimal given the Ω̃(n^2/3) lower bound of [CWX17a]. The algorithm builds on a novel use of the binary search procedure and its analysis over long random paths.

READ FULL TEXT
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
11/25/2019

Near-Optimal Algorithm for Distribution-Free Junta Testing

In this paper, We firstly present an algorithm for the problem of distri...
research
03/29/2016

Regret Analysis of the Anytime Optimally Confident UCB Algorithm

I introduce and analyse an anytime version of the Optimally Confident UC...
research
03/29/2023

Upper bounds on the numbers of binary plateaued and bent functions

The logarithm of the number of binary n-variable bent functions is asymp...
research
06/26/2018

Is your data low-dimensional?

We study the problem of testing if a function depends on a small number ...
research
04/27/2018

On the Estimation of Latent Distances Using Graph Distances

We are given the adjacency matrix of a geometric graph and the task of r...
research
07/13/2020

Adaptive minimax testing for circular convolution

Given observations from a circular random variable contaminated by an ad...

Please sign up or login with your details

Forgot password? Click here to reset