Lazy and Fast Greedy MAP Inference for Determinantal Point Process

Although DPP MAP inference is NP-hard, the greedy algorithm often finds high-quality solutions, and many researchers have studied its efficient implementation.