DppNet: Approximating Determinantal Point Processes with Deep Networks

Zelda Mariet, Jasper Snoek, Yaniv Ovadia

Abstract: Determinantal Point Processes (DPPs) provide an elegant and versatile way to sample sets of items that balance the point-wise quality with the set-wise diversity of selected items. For this reason, they have gained prominence in many machine learning applications that rely on subset selection. However, sampling from a DPP over a ground set of size N is a costly operation, requiring in general an O(N^3) preprocessing cost and an O(Nk^3) sampling cost for subsets of size k. We approach this problem by introducing DppNets: generative deep models that produce DPP-like samples for arbitrary ground sets. We develop an inhibitive attention mechanism based on transformer networks that captures a notion of dissimilarity between feature vectors. We show theoretically that such an approximation is sensible as it maintains the guarantees of inhibition or dissimilarity that makes DPP so powerful and unique. Empirically, we demonstrate that samples from our model receive high likelihood under the more expensive DPP alternative.

Keywords: dpp, submodularity, determinant

TL;DR: We approximate Determinantal Point Processes with neural nets; we justify our model theoretically and empirically.

Data: [CelebA](https://paperswithcode.com/dataset/celeba), [MovieLens](https://paperswithcode.com/dataset/movielens)