Kronecker Determinantal Point Processes

Code

• github.com/UnofficialJuliaMirrorSnapshots/DeterminantalPointProcesses.jl-9d4a7304-c3b4-5347-99a8-9cc862165b3e
  none★ 0
• github.com/alshedivat/DeterminantalPointProcesses.jl
  none★ 0
• github.com/theogf/DeterminantalPointProcesses.jl
  none★ 0
• github.com/UnofficialJuliaMirror/DeterminantalPointProcesses.jl-9d4a7304-c3b4-5347-99a8-9cc862165b3e
  none★ 0

Abstract

Determinantal Point Processes (DPPs) are probabilistic models over all subsets a ground set of N items. They have recently gained prominence in several applications that rely on "diverse" subsets. However, their applicability to large problems is still limited due to the O(N^3) complexity of core tasks such as sampling and learning. We enable efficient sampling and learning for DPPs by introducing KronDPP, a DPP model whose kernel matrix decomposes as a tensor product of multiple smaller kernel matrices. This decomposition immediately enables fast exact sampling. But contrary to what one may expect, leveraging the Kronecker product structure for speeding up DPP learning turns out to be more difficult. We overcome this challenge, and derive batch and stochastic optimization algorithms for efficiently learning the parameters of a KronDPP.

Tasks

Reproductions