REVIEW 1 cited by
Approximate Inference in Continuous Determinantal Point Processes
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Determinantal point processes (DPPs) are random point processes well-suited for modeling repulsion. In machine learning, the focus of DPP-based models has been on diverse subset selection from a discrete and finite base set. This discrete setting admits an efficient sampling algorithm based on the eigendecomposition of the defining kernel matrix. Recently, there has been growing interest in using DPPs defined on continuous spaces. While the discrete-DPP sampler extends formally to the continuous case, computationally, the steps required are not tractable in general. In this paper, we present two efficient DPP sampling schemes that apply to a wide range of kernel functions: one based on low rank approximations via Nystrom and random Fourier feature techniques and another based on Gibbs sampling. We demonstrate the utility of continuous DPPs in repulsive mixture modeling and synthesizing human poses spanning activity spaces.
Forward citations
Cited by 1 Pith paper
-
MASCOT: Model-Aware Submodular Coverage for Composite-Attribute Text-to-Image Retrieval
On composite geography-plus-hour diversity-decrease retrieval, a submodular coverage re-ranker with query-weighted soft bins retains R@10=0.94 versus 0.49 for the manifold-based MS-DPP baseline.
Discussion (0). Continue with ORCID to comment.