Skip to content
arXiv stat.ML · Papers

Cluster with Auctions for Vector Search

arXiv:2607.13728v1 Announce Type: cross Abstract: Large-scale approximate nearest neighbor search commonly relies on partitions for indexing: database vectors are partitioned into clusters, and for each query a probing function selects the clusters to be scanned. The query probing function and the database partition ar