Towards Deterministic Diverse Subset Sampling

by   Joachim Schreurs, et al.

Determinantal point processes (DPPs) are well known models for diverse subset selection problems, including recommendation tasks, document summarization and image search. In this paper, we discuss a greedy deterministic adaptation of k-DPP. Deterministic algorithms are interesting for many applications, as they provide interpretability to the user by having no failure probability and always returning the same results. First, the ability of the method to yield low-rank approximations of kernel matrices is evaluated by comparing the accuracy of the Nyström approximation on multiple datasets. Afterwards, we demonstrate the usefulness of the model on an image search task.


page 6

page 9


Diversity sampling is an implicit regularization for kernel methods

Kernel methods have achieved very good performance on large scale regres...

Ridge Regression and Provable Deterministic Ridge Leverage Score Sampling

Ridge leverage scores provide a balance between low-rank approximation a...

Deterministic POMDPs Revisited

We study a subclass of POMDPs, called Deterministic POMDPs, that is char...

Low-Rank Factorization of Determinantal Point Processes for Recommendation

Determinantal point processes (DPPs) have garnered attention as an elega...

Boosting Nyström Method

The Nyström method is an effective tool to generate low-rank approximati...

Subset Selection for Matrices with Fixed Blocks

Subset selection for matrices is the task of extracting a column sub-mat...

Learning Determinantal Point Processes

Determinantal point processes (DPPs), which arise in random matrix theor...

Please sign up or login with your details

Forgot password? Click here to reset