Adaptive Lower Bound for Testing Monotonicity on the Line

TL;DR

This paper establishes nearly tight lower bounds for the query complexity of testing monotonicity of functions on a line, providing new insights especially in terms of the range size and epsilon parameter.

Contribution

It introduces a nearly tight lower bound in terms of range size r and fully characterizes complexity for smaller epsilon, improving existing bounds.

Findings

Lower bound of Ω(log r / log log r) for range size r at epsilon=1/2

Query complexity of Θ(ε^{-1} log (ε n)) for smaller epsilon

Alternative proof of existing lower bounds for hypergrid monotonicity testing

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 $\epsilon$-testing monotonicity of a function $f\colon [n]\to[r]$. All our lower bounds are for adaptive two-sided testers. * We prove a nearly tight lower bound for this problem in terms of $r$. The bound is $\Omega(\frac{\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).