Efficient Vector Search in the Wild: One Model for Multi-K Queries
Fuente:
arXiv
Salvato in:
| Autori principali: | , , , , , , , , , |
|---|---|
| Natura: | Preprint |
| Pubblicazione: |
2026
|
| Soggetti: | |
| Accesso online: | |
| Tags: |
Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
|
| _version_ | 1866917318238404608 |
|---|---|
| author | Peng, Yifan Fan, Jiafei Wei, Xingda Shen, Sijie Chen, Rong Wang, Jianning Luo, Xiaojian Yu, Wenyuan Zhou, Jingren Chen, Haibo |
| author_facet | Peng, Yifan Fan, Jiafei Wei, Xingda Shen, Sijie Chen, Rong Wang, Jianning Luo, Xiaojian Yu, Wenyuan Zhou, Jingren Chen, Haibo |
| contents | Learned top-K search is a promising approach for serving vector queries with both high accuracy and performance. However, current models trained for a specific K value fail to generalize to real-world multi-K queries: they suffer from accuracy degradation (for larger Ks) and performance loss (for smaller Ks). Training the model to generalize on different Ks requires orders of magnitude more preprocessing time and is not suitable for serving vector queries in the wild. We present OMEGA, a K-generalizable learned top-K search method that simultaneously achieves high accuracy, high performance, and low preprocessing cost for multi-K vector queries. The key idea is that a base model properly trained on K=1 with our trajectory-based features can be used to accurately predict larger Ks with a dynamic refinement procedure and smaller Ks with minimal performance loss. To make our refinements efficient, we further leverage the statistical properties of top-K searches to reduce excessive model invocations. Extensive evaluations on multiple public and production datasets show that, under the same preprocessing budgets, OMEGA achieves 6-33% lower average latency compared to state-of-the-art learned search methods, while all systems achieve the same recall target. With only 16-30% of the preprocessing time, OMEGA attains 1.01-1.28x of the optimal average latency of these baselines. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_06159 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Efficient Vector Search in the Wild: One Model for Multi-K Queries Peng, Yifan Fan, Jiafei Wei, Xingda Shen, Sijie Chen, Rong Wang, Jianning Luo, Xiaojian Yu, Wenyuan Zhou, Jingren Chen, Haibo Databases Information Retrieval Machine Learning Learned top-K search is a promising approach for serving vector queries with both high accuracy and performance. However, current models trained for a specific K value fail to generalize to real-world multi-K queries: they suffer from accuracy degradation (for larger Ks) and performance loss (for smaller Ks). Training the model to generalize on different Ks requires orders of magnitude more preprocessing time and is not suitable for serving vector queries in the wild. We present OMEGA, a K-generalizable learned top-K search method that simultaneously achieves high accuracy, high performance, and low preprocessing cost for multi-K vector queries. The key idea is that a base model properly trained on K=1 with our trajectory-based features can be used to accurately predict larger Ks with a dynamic refinement procedure and smaller Ks with minimal performance loss. To make our refinements efficient, we further leverage the statistical properties of top-K searches to reduce excessive model invocations. Extensive evaluations on multiple public and production datasets show that, under the same preprocessing budgets, OMEGA achieves 6-33% lower average latency compared to state-of-the-art learned search methods, while all systems achieve the same recall target. With only 16-30% of the preprocessing time, OMEGA attains 1.01-1.28x of the optimal average latency of these baselines. |
| title | Efficient Vector Search in the Wild: One Model for Multi-K Queries |
| topic | Databases Information Retrieval Machine Learning |
| url | https://arxiv.org/abs/2603.06159 |