DeepAI AI Chat
Log In Sign Up

Exact Sampling from Determinantal Point Processes

by   Philipp Hennig, et al.

Determinantal point processes (DPPs) are an important concept in random matrix theory and combinatorics. They have also recently attracted interest in the study of numerical methods for machine learning, as they offer an elegant "missing link" between independent Monte Carlo sampling and deterministic evaluation on regular grids, applicable to a general set of spaces. This is helpful whenever an algorithm *explores* to reduce uncertainty, such as in active learning, Bayesian optimization, reinforcement learning, and marginalization in graphical models. To draw samples from a DPP in practice, existing literature focuses on approximate schemes of low cost, or comparably inefficient exact algorithms like rejection sampling. We point out that, for many settings of relevance to machine learning, it is also possible to draw *exact* samples from DPPs on continuous domains. We start from an intuitive example on the real line, which is then generalized to multivariate real vector spaces. We also compare to previously studied approximations, showing that exact sampling, despite higher cost, can be preferable where precision is needed.


page 1

page 2

page 3

page 4


Approximate Inference in Continuous Determinantal Point Processes

Determinantal point processes (DPPs) are random point processes well-sui...

The OS* Algorithm: a Joint Approach to Exact Optimization and Sampling

Most current sampling algorithms for high-dimensional distributions are ...

Exact sampling of determinantal point processes with sublinear time preprocessing

We study the complexity of sampling from a distribution over all index s...

DPPy: Sampling Determinantal Point Processes with Python

Determinantal point processes (DPPs) are specific probability distributi...

Determinantal point processes for machine learning

Determinantal point processes (DPPs) are elegant probabilistic models of...

Monte Carlo Techniques for Approximating the Myerson Value – Theoretical and Empirical Analysis

Myerson first introduced graph-restricted games in order to model the in...

Optimized Algorithms to Sample Determinantal Point Processes

In this technical report, we discuss several sampling algorithms for Det...