{"total":40,"rows":[{"id":"2401.08281","title":"The Faiss library","created":"2024-01-16","cited_by_count":376,"area":null},{"id":"2401.14732","title":"Residual Quantization with Implicit Neural Codebooks","created":"2024-01-26","cited_by_count":25,"area":null},{"id":"2305.04359","title":"ParlayANN: Scalable and Deterministic Parallel Graph-Based Approximate Nearest Neighbor Search Algorithms","created":"2023-05-07","cited_by_count":24,"area":null},{"id":"2308.15136","title":"CAGRA: Highly Parallel Graph Construction and Approximate Nearest Neighbor Search for GPUs","created":"2023-08-29","cited_by_count":22,"area":null},{"id":"2409.17424","title":"Results of the Big ANN: NeurIPS'23 competition","created":"2024-09-25","cited_by_count":22,"area":null},{"id":"2304.04759","title":"Similarity search in the blink of an eye with compressed indices","created":"2023-04-07","cited_by_count":21,"area":null},{"id":"2211.12850","title":"OOD-DiskANN: Efficient and Scalable Graph ANNS for Out-of-Distribution Queries","created":"2022-10-22","cited_by_count":15,"area":null},{"id":"2404.00774","title":"SOAR: Improved Indexing for Approximate Nearest Neighbor Search","created":"2024-03-31","cited_by_count":12,"area":null},{"id":"2308.02752","title":"DeDrift: Robust Similarity Search under Content Drift","created":"2023-08-05","cited_by_count":11,"area":null},{"id":"2501.03078","title":"Qinco2: Vector Compression and Search with Improved Implicit Neural Codebooks","created":"2025-01-06","cited_by_count":8,"area":null},{"id":"2301.01702","title":"Automating Nearest Neighbor Search Configuration with Constrained Optimization","created":"2023-01-04","cited_by_count":7,"area":null},{"id":"2505.17810","title":"VIBE: Vector Index Benchmark for Embeddings","created":"2025-05-23","cited_by_count":6,"area":null},{"id":"2307.03043","title":"A Near-Linear Time Algorithm for the Chamfer Distance","created":"2023-07-06","cited_by_count":5,"area":null},{"id":"2410.18926","title":"LoRANN: Low-Rank Matrix Factorization for Approximate Nearest Neighbor Search","created":"2024-10-24","cited_by_count":4,"area":null},{"id":"2506.16444","title":"REIS: A High-Performance and Energy-Efficient Retrieval System with In-Storage Processing","created":"2025-06-19","cited_by_count":4,"area":null},{"id":"2305.19435","title":"AdANNS: A Framework for Adaptive Semantic Search","created":"2023-05-30","cited_by_count":3,"area":null},{"id":"2405.12207","title":"Optimistic Query Routing in Clustering-based Approximate Maximum Inner Product Search","created":"2024-05-20","cited_by_count":3,"area":null},{"id":"2211.14982","title":"Two Is Better Than One: Dual Embeddings for Complementary Product Recommendations","created":"2022-11-28","cited_by_count":2,"area":null},{"id":"2310.16752","title":"Simple, Scalable and Effective Clustering via One-Dimensional Projections","created":"2023-10-25","cited_by_count":2,"area":null},{"id":"2406.02836","title":"DREW : Towards Robust Data Provenance by Leveraging Error-Controlled Watermarking","created":"2024-06-05","cited_by_count":2,"area":null},{"id":"2402.04713","title":"Theoretical and Empirical Analysis of Adaptive Entry Point Selection for Graph-based Approximate Nearest Neighbor Search","created":"2024-02-07","cited_by_count":1,"area":null},{"id":"2501.10479","title":"Lossless Compression of Vector IDs for Approximate Nearest Neighbor Search","created":"2025-01-16","cited_by_count":1,"area":null},{"id":"2502.16931","title":"Machine learning and high dimensional vector search","created":"2025-02-24","cited_by_count":1,"area":null},{"id":"2506.04790","title":"LotusFilter: Fast Diverse Nearest Neighbor Search via a Learned Cutoff Table","created":"2025-06-05","cited_by_count":1,"area":null},{"id":"2603.23710","title":"An In-Depth Study of Filter-Agnostic Vector Search on a PostgreSQL Database System: [Experiments and Analysis]","created":"2026-03-24","cited_by_count":1,"area":null},{"id":"2403.10746","title":"Vector search with small radiuses","created":"2024-03-16","cited_by_count":0,"area":null},{"id":"2502.06163","title":"Scalable k-Means Clustering for Large k via Seeded Approximate Nearest-Neighbor Search","created":"2025-02-10","cited_by_count":0,"area":null},{"id":"2504.20018","title":"MINT: Multi-Vector Search Index Tuning","created":"2025-04-28","cited_by_count":0,"area":null},{"id":"2505.15636","title":"Distance Adaptive Beam Search for Provably Accurate Graph-Based Nearest Neighbor Search","created":"2025-05-21","cited_by_count":0,"area":null},{"id":"2511.04073","title":"Learning Filter-Aware Distance Metrics for Nearest Neighbor Search with Multiple Filters","created":"2025-11-06","cited_by_count":0,"area":null},{"id":"2601.01930","title":"MCGI: Manifold-Consistent Graph Indexing for Billion-Scale Disk-Resident Vector Search","created":"2026-01-05","cited_by_count":0,"area":null},{"id":"2602.16673","title":"Neighborhood Stability as a Measure of Nearest Neighbor Searchability","created":"2026-02-18","cited_by_count":0,"area":null},{"id":"2602.22214","title":"Adaptive Prefiltering for High-Dimensional Similarity Search: A Frequency-Aware Approach","created":"2025-12-03","cited_by_count":0,"area":null},{"id":"2603.06159","title":"Efficient K-generalizable Learned Search","created":"2026-03-06","cited_by_count":0,"area":null},{"id":"2604.20417","title":"Semantic Recall for Vector Search","created":"2026-04-22","cited_by_count":0,"area":null},{"id":"2606.00809","title":"NBQ: Next-Best-Question for Dynamic Profiling","created":"2026-05-30","cited_by_count":0,"area":null},{"id":"2606.05489","title":"LLM-Guided ANN Index Optimization for Human-Object Interaction Retrieval","created":"2026-06-03","cited_by_count":0,"area":null},{"id":"2607.09909","title":"Learning Partition Trees for Nearest Neighbor Search","created":"2026-07-10","cited_by_count":0,"area":null},{"id":"2608.11240","title":"VQ-bench: A Composable Vector Quantization Framework","created":"2026-07-31","cited_by_count":0,"area":null},{"id":"2608.15438","title":"NeuRoute: Logit-Guided Neural Routing for Billion-Scale Vector Search with Sub-Hour Index Construction","created":"2026-08-15","cited_by_count":0,"area":null}],"next_cursor":null}