mlsanityData to 14 Oct 2026

DPPNet: Approximating Determinantal Point Processes with Deep Networks

arXiv 1901.02051 ↗First posted 7 Jan 2019stat.ML cs.LGcited by 5

Not on the map. Why?

Abstract (arXiv)

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(N3) preprocessing cost and an O(Nk3) 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 DPPs so powerful and unique. Empirically, we demonstrate that samples from our model receive high likelihood under the more expensive DPP alternative.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). First posted on arXiv 7 Jan 2019.

Builds on

No reference list yet.

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 3; 2024: 0; 2025: 0; 2026: 2.

5 papers.