Approximate Inference in Continuous Determinantal Point Processes

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.

References in corpus (2)

• Determinantal point processes for machine learning
• Determinantal point process models and statistical inference : Extended version

Cited by in corpus (7)

• Learning the Parameters of Determinantal Point Process Kernels
• t-METASET: Tailoring Property Bias of Large-Scale Metamaterial Datasets through Active Learning
• Diversified Hidden Markov Models for Sequential Labeling
• Fixed-point algorithms for learning determinantal point processes
• Large-Margin Determinantal Point Processes
• Learning compositional models of robot skills for task and motion planning
• A Polynomial Time MCMC Method for Sampling from Continuous DPPs