Abstract

We study the question of identity testing for structured distributions. More precisely, given samples from a {\em structured} distribution qq over [n][n] and an explicit distribution pp over [n][n], we wish to distinguish whether q=pq=p versus qq is at least εε-far from pp, in L1L_1 distance. In this work, we present a unified approach that yields new, simple testers, with sample complexity that is information-theoretically optimal, for broad classes of structured distributions, including tt-flat distributions, tt-modal distributions, log-concave distributions, monotone hazard rate (MHR) distributions, and mixtures thereof.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.