arXiv (All)
open access
Efficient K-generalizable Learned Search
Learned top-K search improves the accuracy-latency trade-off of graph-based vector search, but existing methods are designed for a fixed K: serving production workloads with varying K values requires preprocessing cost proportional to the number of distinct Ks served - prohibitive in practice. This
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- TEngineDB-V: An OLAP-Native Vector Search System for Large-$k$ Workloads at Tencent#424082
- PASCAL: A Phase-Aware Shared-Cache Model for Parallel Scans#997387
- Mixed-Precision Computing for Scientific Discovery: Formats, Co-Design, and Responsible Approximation#1132338
- Benchmarking Storage Systems for Machine Learning Workloads Using NIO Bench#972485
- High-Performance Star-M SVD for Big Data Compression#194285
Record · ID 1050829
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive