2019
A Polynomial Time MCMC Method for Sampling from Continuous Determinantal Point Processes
ICML 2019oral
We study the Gibbs sampling algorithm for discrete and continuous $k$-determinantal point processes. We show that in both cases, the spectral gap of the chain is bounded by a polynomial of $k$ and it is independent of the size of the domain. As an immediate corollary, we obtain sublinear time algori…