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

Joshua Engels, Benjamin Coleman, Vihan Lakshman +1

We study the problem of $\text{vector set search}$ with $\text{vector set queries}$. This task is analogous to traditional near-neighbor search, with the exception that both th…