Testing Determinantal Point Processes

08/09/2020
by   Khashayar Gatmiry, et al.
0

Determinantal point processes (DPPs) are popular probabilistic models of diversity. In this paper, we investigate DPPs from a new perspective: property testing of distributions. Given sample access to an unknown distribution q over the subsets of a ground set, we aim to distinguish whether q is a DPP distribution, or ϵ-far from all DPP distributions in ℓ_1-distance. In this work, we propose the first algorithm for testing DPPs. Furthermore, we establish a matching lower bound on the sample complexity of DPP testing. This lower bound also extends to showing a new hardness result for the problem of testing the more general class of log-submodular distributions.

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
07/14/2022

Near-Optimal Bounds for Testing Histogram Distributions

We investigate the problem of testing whether a discrete probability dis...
research
01/12/2022

On the Statistical Complexity of Sample Amplification

Given n i.i.d. samples drawn from an unknown distribution P, when is it ...
research
10/12/2021

As Easy as ABC: Adaptive Binning Coincidence Test for Uniformity Testing

We consider the problem of uniformity testing of Lipschitz continuous di...
research
08/22/2023

Tight Lower Bound on Equivalence Testing in Conditional Sampling Model

We study the equivalence testing problem where the goal is to determine ...
research
03/28/2022

A super-polynomial lower bound for learning nonparametric mixtures

We study the problem of learning nonparametric distributions in a finite...
research
08/15/2017

Generalized Uniformity Testing

In this work, we revisit the problem of uniformity testing of discrete p...

Please sign up or login with your details

Forgot password? Click here to reset