Exact sampling of determinantal point processes with sublinear time preprocessing

05/31/2019
by   Michał Dereziński, et al.
0

We study the complexity of sampling from a distribution over all index subsets of the set {1,...,n} with the probability of a subset S proportional to the determinant of the submatrix L_S of some n× n p.s.d. matrix L, where L_S corresponds to the entries of L indexed by S. Known as a determinantal point process, this distribution is used in machine learning to induce diversity in subset selection. In practice, we often wish to sample multiple subsets S with small expected size k = E[|S|] ≪ n from a very large matrix L, so it is important to minimize the preprocessing cost of the procedure (performed once) as well as the sampling cost (performed repeatedly). For this purpose, we propose a new algorithm which, given access to L, samples exactly from a determinantal point process while satisfying the following two properties: (1) its preprocessing cost is n ·poly(k), i.e., sublinear in the size of L, and (2) its sampling cost is poly(k), i.e., independent of the size of L. Prior to our results, state-of-the-art exact samplers required O(n^3) preprocessing time and sampling time linear in n or dependent on the spectral properties of L. We also give a reduction which allows using our algorithm for exact sampling from cardinality constrained determinantal point processes with n·poly(k) time preprocessing.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/08/2018

Fast determinantal point processes via distortion-free intermediate sampling

Given a fixed n× d matrix X, where n≫ d, we study the complexity of samp...
research
01/07/2019

DPPNet: Approximating Determinantal Point Processes with Deep Networks

Determinantal Point Processes (DPPs) provide an elegant and versatile wa...
research
04/06/2022

Optimal Sublinear Sampling of Spanning Trees and Determinantal Point Processes via Average-Case Entropic Independence

We design fast algorithms for repeatedly sampling from strongly Rayleigh...
research
05/29/2021

Rejection sampling from shape-constrained distributions in sublinear time

We consider the task of generating exact samples from a target distribut...
research
03/05/2018

Asymptotic Equivalence of Fixed-size and Varying-size Determinantal Point Processes

Determinantal Point Processes (DPPs) are popular models for point proces...
research
09/22/2016

Exact Sampling from Determinantal Point Processes

Determinantal point processes (DPPs) are an important concept in random ...
research
03/23/2018

Determinantal Point Processes for Coresets

When one is faced with a dataset too large to be used all at once, an ob...

Please sign up or login with your details

Forgot password? Click here to reset