paper-with-me

홈 › Papers

Deep Determinantal Point Processes

2018-11-17 · Mike Gartrell, Elvis Dohmatob, Jon Alberdi

Determinantal point processes (DPPs) have attracted significant attention as an elegant model that is able to capture the balance between quality and diversity within sets. DPPs are parameterized by a positive semi-definite kernel matrix. While DPPs have substantial expressive power, they are fundamentally limited by the parameterization of the kernel matrix and their inability to capture nonlinear interactions between items within sets. We present the deep DPP model as way to address these limitations, by using a deep feed-forward neural network to learn the kernel matrix. In addition to allowing us to capture nonlinear item interactions, the deep DPP also allows easy incorporation of item metadata into DPP learning. Since the learning target is the DPP kernel matrix, the deep DPP allows us to use existing DPP algorithms for efficient learning, sampling, and prediction. Through an evaluation on several real-world datasets, we show experimentally that the deep DPP can provide a considerable improvement in the predictive performance of DPPs, while also outperforming strong baseline models in many cases.

📄 PDF Abstract BibTeX arXiv:1811.07245

Code (0)

등록된 구현이 없습니다.

Tasks

DiversityPoint Processes

Similar Papers 제목 키워드 기반

Fast Sampling for Strongly Rayleigh Measures with Application to Determinantal Point Processes

2016-07-13 · Chengtao Li, Stefanie Jegelka, Suvrit Sra

In this note we consider sampling from (non-homogeneous) strongly Rayleigh probability measures. As an important corollary, we obtain a fast mixing Markov Chain sampler for Determinantal Point Processes.

Point Processes

A New Many-Objective Evolutionary Algorithm Based on Determinantal Point Processes

2020-12-15 · Peng Zhang, Jinlong Li, Tengfei Li, Huanhuan Chen

To handle different types of Many-Objective Optimization Problems (MaOPs), Many-Objective Evolutionary Algorithms (MaOEAs) need to simultaneously maintain convergence and population diversity in the high-dimensional obje…

DiversityEvolutionary AlgorithmsPoint Processes

Determinantal thinning of point processes with network learning applications

2018-10-09 · Bartłomiej Błaszczyszyn, Paul Keeler

A new type of dependent thinning for point processes in continuous space is proposed, which leverages the advantages of determinantal point processes defined on finite spaces and, as such, is particularly amenable to sta…

Point ProcessesScheduling

Structured Determinantal Point Processes

2010-12-01 · NeurIPS 2010 12 · Alex Kulesza, Ben Taskar

We present a novel probabilistic model for distributions over sets of structures -- for example, sets of sequences, trees, or graphs. The critical characteristic of our model is a preference for diversity: sets containin…

DiversityPoint ProcessesPose Estimation

Coverage probability in wireless networks with determinantal scheduling

2020-06-09 · Bartek Błaszczyszyn, Antoine Brochard, H. Paul Keeler

We propose a new class of algorithms for randomly scheduling network transmissions. The idea is to use (discrete) determinantal point processes (subsets) to randomly assign medium access to various {\em repulsive} subset…

Point ProcessesScheduling