Scalable Learning and MAP Inference for Nonsymmetric Determinantal Point Processes

06/17/2020
by   Mike Gartrell, et al.
Google
Criteo
KAIST 수리과학과
Ensae ParisTech
0

Determinantal point processes (DPPs) have attracted significant attention from the machine learning community for their ability to model subsets drawn from a large collection of items. Recent work shows that nonsymmetric DPP kernels have significant advantages over symmetric kernels in terms of modeling power and predictive performance. However, the nonsymmetric kernel learning algorithm from prior work has computational complexity that is cubic in the size of the DPP ground set, from which subsets are drawn, making it impractical to use at large scales. In this work, we propose a new decomposition for nonsymmetric DPP kernels that induces linear-time complexity for learning and approximate maximum a posteriori (MAP) inference. We also prove a lower bound on the quality of this MAP approximation. Through evaluation on real-world datasets, we show that our new decomposition not only scales better, but also matches or exceeds the predictive performance of prior work.

READ FULL TEXT

page 1

page 2

page 3

page 4

01/20/2022

Scalable Sampling for Nonsymmetric Determinantal Point Processes

A determinantal point process (DPP) on a collection of M items is a mode...
07/01/2022

Scalable MCMC Sampling for Nonsymmetric Determinantal Point Processes

A determinantal point process (DPP) is an elegant model that assigns a p...
11/19/2020

Wasserstein Learning of Determinantal Point Processes

Determinantal point processes (DPPs) have received significant attention...
02/10/2021

Simple and Near-Optimal MAP Inference for Nonsymmetric DPPs

Determinantal point processes (DPPs) are widely popular probabilistic mo...
02/15/2018

Learning Determinantal Point Processes by Sampling Inferred Negatives

Determinantal Point Processes (DPPs) have attracted significant interest...
10/04/2012

A Scalable CUR Matrix Decomposition Algorithm: Lower Time Complexity and Tighter Bound

The CUR matrix decomposition is an important extension of Nyström approx...
03/18/2019

Linear-Time Inference for Pairwise Comparisons with Gaussian-Process Dynamics

We present a probabilistic model of pairwise-comparison outcomes that ca...

Please sign up or login with your details

Forgot password? Click here to reset