arXiv CS
open access
SOLO: Certified-Recall Metric Similarity Search with Scan-Only Sampled Inverted Lists
We present SOLO, an index for approximate nearest-neighbor search in general metric spaces whose serving path contains no ranking heuristic of any kind: a query is routed to the $k_s$ nearest points of a random sample of the database, and every object in the touched posting lists is evaluated with t
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
- SOLO: Certified-Recall Metric Similarity Search with Scan-Only Sampled Inverted Lists#1186701
- Analyzing and Reducing Search Quality Differences in Vector Similarity Search#1043170
- The Erdős similarity problem for null sequences with adjacent ratios bounded below#1248729
- Geometric Hashing in MPC with Applications to Clustering and Stochastic Embeddings#1356707
- CRM: Retrieval Model with Controllable Condition#1296935
Record · ID 1181724
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