Learning Signed Determinantal Point Processes through the Principal Minor Assignment Problem

arXiv1811.00465MaRDI QIDQ6309092FDOQ6309092

Publication date: 1 November 2018

Abstract: Symmetric determinantal point processes (DPP's) are a class of probabilistic models that encode the random selection of items that exhibit a repulsive behavior. They have attracted a lot of attention in machine learning, when returning diverse sets of items is sought for. Sampling and learning these symmetric DPP's is pretty well understood. In this work, we consider a new class of DPP's, which we call signed DPP's, where we break the symmetry and allow attractive behaviors. We set the ground for learning signed DPP's through a method of moments, by solving the so called principal assignment problem for a class of matrices

K

that satisfy

K_{i, j} = p m K_{j, i}

,

i e q j

, in polynomial time.

This page was built for publication: Learning Signed Determinantal Point Processes through the Principal Minor Assignment Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6309092)