DeepAI AI Chat
Log In Sign Up

Parameterized Convexity Testing

10/25/2021
by   Abhiruk Lahiri, et al.
Chennai Mathematical Institute
University of Haifa
Ariel University
0

In this work, we develop new insights into the fundamental problem of convexity testing of real-valued functions over the domain [n]. Specifically, we present a nonadaptive algorithm that, given inputs ∈ (0,1), s ∈ℕ, and oracle access to a function, -tests convexity in O(log (s)/), where s is an upper bound on the number of distinct discrete derivatives of the function. We also show that this bound is tight. Since s ≤ n, our query complexity bound is at least as good as that of the optimal convexity tester (Ben Eliezer; ITCS 2019) with complexity O(log n/); our bound is strictly better when s = o(n). The main contribution of our work is to appropriately parameterize the complexity of convexity testing to circumvent the worst-case lower bound (Belovs et al.; SODA 2020) of Ω(log ( n)/) expressed in terms of the input size and obtain a more efficient algorithm.

READ FULL TEXT

page 1

page 2

page 3

page 4

08/07/2019

Testing convexity of functions over finite domains

We establish new upper and lower bounds on the number of queries require...
11/25/2019

Near-Optimal Algorithm for Distribution-Free Junta Testing

In this paper, We firstly present an algorithm for the problem of distri...
04/04/2022

An Optimal Algorithm for Certifying Monotone Functions

Given query access to a monotone function f{0,1}^n→{0,1} with certificat...
05/04/2023

Testing Convexity of Discrete Sets in High Dimensions

We study the problem of testing whether an unknown set S in n dimensions...
05/15/2023

Log-concavity and log-convexity of series containing multiple Pochhammer symbols

In this paper we study power series with coefficients equal to a product...
09/23/2003

Fast Verification of Convexity of Piecewise-linear Surfaces

We show that a realization of a closed connected PL-manifold of dimensio...
06/08/2020

Generalizing the Sharp Threshold Phenomenon for the Distributed Complexity of the Lovász Local Lemma

Recently, Brandt, Maus and Uitto [PODC'19] showed that, in a restricted ...