Testing k-Monotonicity

  title={Testing k-Monotonicity},
  author={Cl{\'e}ment L. Canonne and Elena Grigorescu and Siyao Guo and Akash Kumar and Karl Wimmer},
  journal={Electron. Colloquium Comput. Complex.},
A Boolean $k$-monotone function defined over a finite poset domain ${\cal D}$ alternates between the values $0$ and $1$ at most $k$ times on any ascending chain in ${\cal D}$. Therefore, $k$-monotone functions are natural generalizations of the classical monotone functions, which are the $1$-monotone functions. Motivated by the recent interest in $k$-monotone functions in the context of circuit complexity and learning theory, and by the central role that monotonicity testing plays in the… 

Tables from this paper

Properly learning monotone functions via local reconstruction

The core of the proper learner is a local computation algorithm for sorting binary labels on a poset that is robust to adversarial label noise and has a running time nearly matching that of the state-of-the-art improper learning algorithm.

Testing distributional assumptions of learning algorithms

This work proposes a model by which to systematically study the design of tester-learner pairs, such that if the distribution on examples in the data passes the tester T then one can safely trust the output of the agnostic learner A on the data.

Downsampling for Testing and Learning in Product Distributions

We study the domain reduction problem of eliminating dependence on $n$ from the complexity of property testing and learning algorithms on domain $[n]^d$, and the related problem of establishing

Almost Optimal Distribution-Free Sample-Based Testing of k-Modality

This work studies one-sided error property testing of k-modality in the distribution-free sample-based model and proves an upper bound of1 O (√ kn log k ) on the sample complexity, and an almost matching lower bound of Ω ( √ kn ) .

Earthmover Resilience and Testing in Ordered Structures

A wide class of properties of ordered structures - the earthmover resilient (ER) properties - are identified and it is shown that the "good behavior" of such properties allows us to obtain general testability results that are similar to (and more general than) those of unordered graphs.

Flipping out with Many Flips: Hardness of Testing k-Monotonicity

This work studies k-monotone functions in the more relaxed parametrized property testing model, introduced by Parnas et al. (JCSS, 72(6), 2006), and resolves a problem left open in previous work.

Improved Bounds for Testing Forbidden Order Patterns

An adaptivity hierarchy for $\pi=(1,3,2)$ is shown by proving upper and lower bounds for (one- and two-sided) testing of $\pi$-freeness with $r$ rounds of adaptivity and demonstrating a surprising behavior for non-adaptive tests with one-sided error.

Proofs of Proximity for Distribution Testing

The main results include showing that MA distribution testers can be quadratically stronger than standard distribution testers, but no stronger than that; in contrast, IP distribution testers are shown to be exponentially stronger than normal distributions, but when restricted to public coins they can be at best quadratic stronger.

K-Monotonicity is Not Testable on the Hypercube

This work disproves the conjecture that k-monotonicity can be tested with poly(n) queries, and shows that even 2-monotone requires an exponential in √ n number of queries.

Testing Hereditary Properties of Ordered Graphs and Matrices

The proof bridges the gap between techniques related to the regularity lemma, used in the long chain of papers investigating graph testing, and string testing techniques and develops a Ramsey-type lemma for multipartite graphs with undesirable edges.



Monotonicity testing over general poset domains

It is shown that in its most general setting, testing that Boolean functions are close to monotone is equivalent, with respect to the number of required queries, to several other testing problems in logic and graph theory.

SERVEDIO, AND LI-YANG TAN: Learning circuits with few negations. In Approximation, Randomization, and Combinatorial Optimization

  • Algorithms and Techniques (RANDOM 2015),
  • 2015


  • In Proc. 46th STOC,
  • 2014

Testing Probability Distributions Underlying Aggregated Data

This paper considers both the dual and cumulative dual access models, in which the algorithm A can both sample from D and respectively query the probability mass D(i) (query access) and get the total mass of {1,…,i}, i.e. \(\sum_{j=1}^i D(j) (cumulative access).

Testing Problems with Sublearning Sample Complexity

This work studies the problem of determining, for a class of functions H, whether an unknown target function f is contained in H or is “far” from any function in H, and demonstrates that the number of examples required for testing grows only as O(s1/2+?) (where ? is any small constant).

A Superpolynomial Lower Bound for a Circuit Computing the Clique Function with at most (1/6)log log n Negation Gates

It is shown that the problem of lower bounding the negation-limited circuit complexity can be reduced to the one of lowerbounding the maximum of the monotone circuit complexity of the functions in a certain class ofmonotone functions.

Monotone circuits for matching require linear depth

It is proven that monotone circuits computing the perfect matching function on <italic>n</italic>-vertex graphs require &OHgr;(<italic>n</italic>) depth. This implies an exponential gap between the

Tolerant property testing and distance approximation

Boolean Function Complexity Advances and Frontiers

This book is a comprehensive description of basic lower bound arguments, covering many of the gems of this complexity Waterloo that have been discovered over the past several decades, right up to results from the last year or two.