DeepAI AI Chat
Log In Sign Up

Testing convexity of functions over finite domains

by   Aleksandrs Belovs, et al.
University of Waterloo
University of Latvia

We establish new upper and lower bounds on the number of queries required to test convexity of functions over various discrete domains. 1. We provide a simplified version of the non-adaptive convexity tester on the line. We re-prove the upper bound O(log(ϵ n)/ϵ) in the usual uniform model, and prove an O(log n/ϵ) upper bound in the distribution-free setting. 2. We show a tight lower bound of Ω(log(ϵ n)/ϵ) queries for testing convexity of functions f: [n] →R on the line. This lower bound applies to both adaptive and non-adaptive algorithms, and matches the upper bound from item 1, showing that adaptivity does not help in this setting. 3. Moving to higher dimensions, we consider the case of a stripe [3] × [n]. We construct an adaptive tester for convexity of functions f [3] × [n] →R with query complexity O(log^2 n). We also show that any non-adaptive tester must use Ω(√(n)) queries in this setting. Thus, adaptivity yields an exponential improvement for this problem. 4. For functions f [n]^d →R over domains of dimension d ≥ 2, we show a non-adaptive query lower bound Ω((n/d)^d/2).


page 1

page 2

page 3

page 4


Parameterized Convexity Testing

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

Computing majority with low-fan-in majority queries

In this paper we examine the problem of computing majority function MAJ_...

A Minimax Theory for Adaptive Data Analysis

In adaptive data analysis, the user makes a sequence of queries on the d...

The Query Complexity of Mastermind with ℓ_p Distances

Consider a variant of the Mastermind game in which queries are ℓ_p dista...

An Axiomatic Approach to Formalized Responsibility Ascription

Quantified responsibility ascription in complex scenarios is of crucial ...

On the Gap Between Strict-Saddles and True Convexity: An Omega(log d) Lower Bound for Eigenvector Approximation

We prove a query complexity lower bound on rank-one principal component ...

Understanding the hardness of approximate query processing with joins

We study the hardness of Approximate Query Processing (AQP) of various t...