Search Results for author:
Found 2 papers, 0 papers with code
Optimistic Query Routing in Clustering-based Approximate Maximum Inner Product Search
Clustering-based nearest neighbor search is a simple yet effective method in which data points are partitioned into geometric shards to form an index, and only a few shards are searched during query processing to find an approximate set of top-$k$ vectors.
Lifelong Learning with Sketched Structural Regularization
In practice and due to computational constraints, most SR methods crudely approximate the importance matrix by its diagonal.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
