Lazy and Fast Greedy MAP Inference for Determinantal Point Process

1 code implementation • 13 Jun 2022 • Shinichi Hemmi, Taihei Oki, Shinsaku Sakaue, Kaito Fujii, Satoru Iwata

One classical and practical method is the lazy greedy algorithm, which is applicable to general submodular function maximization, while a recent fast greedy algorithm based on the Cholesky factorization is more efficient for DPP MAP inference.

Point Processes