20d135f0f28185b84a4cf7aa51f29500-Reviews.html

First provide a summary of the paper, and then address the following criteria: Quality, clarity, originality and significance. The goal of this paper is to build a markov chain that will sample from a determinantal point process. One that mixes rapidly, and improves on the O(n^3) direct computation. One benefit is that as the set of elements in the DPP changes, there is no expensive eigenvalue decomposition. The fast algorithm is achieved with the realization that the algorithm doesn't require the computation of matrix determinants, but the ratio of determinants.