Metraipolis › archive › dc_477c6b3cb2ea
SweepANN: A GPU-Accelerated Large-K Approximate Vector Search for Drug Discovery — arXiv:2610.27306
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.27306
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-21T07:11:26.784Z
- SHA-256 of the archived text
d83890fd8c8b216d1a78f2efc5b5fa60dc4c18912e2c96274ff0d1f150e4b267- Stable URL of this page
https://metraipolis.com/documento/dc_477c6b3cb2ea
How to cite
SweepANN: A GPU-Accelerated Large-K Approximate Vector Search for Drug Discovery — arXiv:2610.27306 — arXiv (en), https://arxiv.org/abs/2610.27306 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_477c6b3cb2ea (Metraipolis archive dc_477c6b3cb2ea, sha256 d83890fd8c8b216d1a78f2efc5b5fa60dc4c18912e2c96274ff0d1f150e4b267)
BibTeX
@misc{dc477c6b3cb2ea,
title = {SweepANN: A GPU-Accelerated Large-K Approximate Vector Search for Drug Discovery — arXiv:2610.27306},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.27306},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_477c6b3cb2ea; sha256 d83890fd8c8b216d1a78f2efc5b5fa60dc4c18912e2c96274ff0d1f150e4b267},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.27306. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
DrugCLIP places small molecules and protein pockets in one space, turning genome-wide drug discovery into large-K retrieval by vector proximity. A campaign fixes over 20K pockets in advance for one library of over 500M molecules. Each pocket keeps K = 500K candidates, 0.1% of the collection, versus 100 in ANN benchmarks. Missed hits never get tested, so mean recall must reach 99% relative to exact search. Large answers make IVF probe every list holding a result and graph search track K or more candidates, so costs grow with K. On our CPUs and GPUs, neither index family reaches the target without losing most of its edge over scanning. SweepANN partitions compressed vectors across GPUs and scans each resident partition. One matrix multiplication scores each block for a whole query batch, reading it once. Several plans perform the K-dependent selection and merging of each query's K answers, each returning an exact top-K under compressed scoring. The window plan retains each query's best K from sampled blocks as its seed, and only rows above each seed's minimum score, shared once across GPUs, enter the buffers. Four Blackwell GPUs (RTX PRO 6000) answer all 26,562 pockets with a resident time of about 61 seconds, excluding library loading, and 99.6% mean recall relative to exact FP32 search. DrugCLIP reports roughly 24 hours with eight A100 GPUs in its own campaign. On 500M rows, the window plan runs 1.41x faster than SweepANN's grouped plan in the same memory. Across 25M-500M rows and K of 10K-500K, all GPU IVF configurations meeting the recall target take 8.2-24x SweepANN's resident time. On DEEP1B's 1B vectors across eight GPUs, against SweepANN's exact full-score scan of uncompressed FP32 rows, the window plan cuts resident time by 5.4x and 3.2x at K = 100K and 500K. It also cuts per-GPU peak memory by 6.0x and 5.3x, losing 1.0 and 0.7 mean-recall points. Tema degli esploratori: calcolo e infrastrutture (elenco arXiv cs.DC, nuovi lavori del giorno). Categorie arXiv: Databases (cs.DB) ; Distributed, Parallel, and Cluster Computing (cs.DC); Information Retrieval (cs.IR). Pagina del lavoro: https://arxiv.org/abs/2610.27306 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-21T07:06:13.134Z dalla pagina https://arxiv.org/list/cs.DC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).