REVIEW 5 cited by
SOAR: Improved Indexing for Approximate Nearest Neighbor Search
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
SOAR: Improved Indexing for Approximate Nearest Neighbor Search
read the original abstract
This paper introduces SOAR: Spilling with Orthogonality-Amplified Residuals, a novel data indexing technique for approximate nearest neighbor (ANN) search. SOAR extends upon previous approaches to ANN search, such as spill trees, that utilize multiple redundant representations while partitioning the data to reduce the probability of missing a nearest neighbor during search. Rather than training and computing these redundant representations independently, however, SOAR uses an orthogonality-amplified residual loss, which optimizes each representation to compensate for cases where other representations perform poorly. This drastically improves the overall index quality, resulting in state-of-the-art ANN benchmark performance while maintaining fast indexing times and low memory consumption.
Forward citations
Cited by 5 Pith papers
-
A Replicability Study of XTR
XTR training does not improve retrieval effectiveness over ColBERT but enhances IVF engine efficiency by flattening token scores to produce more discriminative centroids.
-
Vectorizing the Trie: Efficient Constrained Decoding for LLM-based Generative Retrieval on Accelerators
Constrained decoding for generative retrieval can be made accelerator-friendly by flattening the trie of valid items into a CSR sparse matrix and doing branch-free vectorized lookups.
-
RACORN-1: Adaptive Recall-Preserving Speedup for Low-Selectivity Filtered Vector Search
RACORN-1 adds adaptive search fallback to ACORN-1 to fix recall collapse at low selectivity in filtered vector search, achieving 9-26x speedups over HNSW with recovered recall on 1M-40M datasets.
-
Health System Scale Semantic Search Across Unstructured Clinical Notes
Production semantic search over 166M clinical notes achieves sub-second latency at ~$4k/month and recovers 98% of genetic-disease patients versus ≤75% by ICD-10 codes.
-
Health System Scale Semantic Search Across Unstructured Clinical Notes
A semantic search system was deployed at health-system scale across 166 million clinical notes, delivering sub-second latency, ~$4000 monthly cost, and 24-89% faster chart abstraction with maintained agreement.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.