New Lower Bounds for Testing Monotonicity and Log Concavity of Distributions

07/31/2023
by   Yuqian Cheng, et al.
0

We develop a new technique for proving distribution testing lower bounds for properties defined by inequalities involving the bin probabilities of the distribution in question. Using this technique we obtain new lower bounds for monotonicity testing over discrete cubes and tight lower bounds for log-concavity testing. Our basic technique involves constructing a pair of moment-matching families of distributions by tweaking the probabilities of pairs of bins so that one family maintains the defining inequalities while the other violates them.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
07/06/2019

Towards Testing Monotonicity of Distributions Over General Posets

In this work, we consider the sample complexity required for testing the...
research
06/04/2018

Sequential Test for the Lowest Mean: From Thompson to Murphy Sampling

Learning the minimum/maximum mean among a finite set of distributions is...
research
07/04/2022

The Best Bounds for Range Type Statistics

In this paper, we obtain the upper and lower bounds for two inequalities...
research
04/03/2023

Distribution Testing Under the Parity Trace

Distribution testing is a fundamental statistical task with many applica...
research
06/13/2017

Lost Relatives of the Gumbel Trick

The Gumbel trick is a method to sample from a discrete probability distr...
research
06/09/2022

Optimal SQ Lower Bounds for Robustly Learning Discrete Product Distributions and Ising Models

We establish optimal Statistical Query (SQ) lower bounds for robustly le...
research
06/16/2018

Advice Complexity of Priority Algorithms

The priority model of "greedy-like" algorithms was introduced by Borodin...

Please sign up or login with your details

Forgot password? Click here to reset