Search Results for author:
Found 2 papers, 1 papers with code
Lazy and Fast Greedy MAP Inference for Determinantal Point Process
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.
Minimum Average Cost Clustering
In this paper, we introduce the minimum average cost criterion, and show that the theory of intersecting submodular functions can be used for clustering with submodular objective functions.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
