Belovs, Aleksandrs
Adaptive Lower Bound for Testing Monotonicity on the Line
Abstract
In the property testing model, the task is to distinguish objects possessing some property from the objects that are far from it. One of such properties is monotonicity, when the objects are functions from one poset to another. This is an active area of research. In this paper we study query complexity of epsilontesting monotonicity of a function f : [n]>[r]. All our lower bounds are for adaptive twosided testers.
 We prove a nearly tight lower bound for this problem in terms of r. The bound is Omega((log r)/(log log r)) when epsilon = 1/2. No previous satisfactory lower bound in terms of r was known.
 We completely characterise query complexity of this problem in terms of n for smaller values of epsilon. The complexity is Theta(epsilon^{1} log (epsilon n)). Apart from giving the lower bound, this improves on the best known upper bound.
Finally, we give an alternative proof of the Omega(epsilon^{1}d log n  epsilon^{1}log epsilon^{1}) lower bound for testing monotonicity on the hypergrid [n]^d due to Chakrabarty and Seshadhri (RANDOM'13).
BibTeX  Entry
@InProceedings{belovs:LIPIcs:2018:9435,
author = {Aleksandrs Belovs},
title = {{Adaptive Lower Bound for Testing Monotonicity on the Line}},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)},
pages = {31:131:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {9783959770859},
ISSN = {18688969},
year = {2018},
volume = {116},
editor = {Eric Blais and Klaus Jansen and Jos{\'e} D. P. Rolim and David Steurer},
publisher = {Schloss DagstuhlLeibnizZentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9435},
URN = {urn:nbn:de:0030drops94350},
doi = {10.4230/LIPIcs.APPROXRANDOM.2018.31},
annote = {Keywords: property testing, monotonicity on the line, monotonicity on the hypergrid}
}
2018
Keywords: 

property testing, monotonicity on the line, monotonicity on the hypergrid 
Seminar: 

Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM 2018)

Issue date: 

2018 
Date of publication: 

2018 