Fast Greedy MAP Inference for Determinantal Point Process to Improve Recommendation Diversity
By Laming Chen, Guoxin Zhang, Eric Zhou. Neural Information Processing Systems, 2017
367 citations recorded by the source corpus.
View Paper: https://www.semanticscholar.org/paper/c50ec6761f013ffd73d9bbf392dcba7ae990df92
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
- Stefan T. Radev
- Ullrich Köthe
- Ulf K. Mertens
- A. Voss
- Lynton Ardizzone
- Eric-Jan Wagenmakers
- Denis A. Gudovskiy
Citations in the corpus
- BayesFlow: Learning Complex Stochastic Models With Invertible Neural Networks (2020, background): “Our ideas are also closely related to the concept of optimal transport maps and its application in Bayesian inference [12, 43, 7, 4].”
- Differentiable Scaffolding Tree for Molecular Optimization (2021, unknown): “DPP models the repulsive correlation between data points [28] and has been successfully applied to many applications such as text summarization [7], mini-batch sampling [50], and recommendation system [6].”
- Constrained Dominant Sets for Multimodal Document Question Answering (2026, unknown): “We seek the MAP configuration R = arg max which is NP-hard, and approximate it with the fast greedy algorithm of [13].”