← Search

Vihan Lakshman

2 accepted papers

2023

DESSERT: An Efficient Algorithm for Vector Set Search with Vector Set Queries

NeurIPS 2023poster

We study the problem of $\text{\emph{vector set search}}$ with $\text{\emph{vector set queries}}$. This task is analogous to traditional near-neighbor search, with the exception that both the query and each element in the collection are $\text{\textit{sets}}$ of vectors. We identify this problem as…