Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 2 of 2 for “"Diverse Subset Selection"”.

  1. Representation learning for non-sequential data

    … First, we formulate a new method for performing diverse subset selection using a neural set function approximation method. This method relies on the deep sets idea, which says that any set function s(X) has a universal approximator of the form f([sigma]x[xi]X [phi](x)). Second, we design a new …

    mit Repository record for Representation learning for non-sequential data (opens in a new tab)

  2. Scalable Inference Algorithms for Determinantal Point Processes

    … (DPPs) are probability distributions on subsets of a collection of points that tend to generate diverse configurations of points. This feature makes them suitable as a probabilistic model of diversity. Recently this idea has been exploited extensively in subset selection problems, where …

    washington Repository record for Scalable Inference Algorithms for Determinantal Point Processes (opens in a new tab)