{"total":99,"rows":[{"id":"2401.08281","title":"The Faiss library","created":"2024-01-16","cited_by_count":376,"area":null},{"id":"2205.03763","title":"Results of the NeurIPS'21 Challenge on Billion-Scale Approximate Nearest Neighbor Search","created":"2022-05-08","cited_by_count":45,"area":null},{"id":"2201.05176","title":"Neural Approaches to Conversational Information Retrieval","created":"2022-01-13","cited_by_count":42,"area":null},{"id":"2305.09253","title":"Online Continual Learning Without the Storage Constraint","created":"2023-05-16","cited_by_count":29,"area":null},{"id":"2103.11933","title":"PatentSBERTa: A Deep NLP based Hybrid Model for Patent Distance and Classification using Augmented SBERT","created":"2021-03-22","cited_by_count":24,"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":"2206.14286","title":"TPU-KNN: K Nearest Neighbor Search at Peak FLOP/s","created":"2022-06-28","cited_by_count":18,"area":null},{"id":"2207.03061","title":"Back to the Basics: Revisiting Out-of-Distribution Detection Baselines","created":"2022-07-07","cited_by_count":16,"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":"2203.14541","title":"Specialized Document Embeddings for Aspect-based Similarity of Research Papers","created":"2022-03-28","cited_by_count":12,"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":"2402.00943","title":"Approximate Nearest Neighbor Search with Window Filters","created":"2024-02-01","cited_by_count":11,"area":null},{"id":"2402.02044","title":"Locally-Adaptive Quantization for Streaming Vector Search","created":"2024-02-03","cited_by_count":11,"area":null},{"id":"2303.06210","title":"A Theoretical Analysis Of Nearest Neighbor Search On Approximate Near Neighbor Graph","created":"2023-03-10","cited_by_count":10,"area":null},{"id":"2107.02736","title":"DEANN: Speeding up Kernel-Density Estimation using Approximate Nearest Neighbor Search","created":"2021-07-06","cited_by_count":8,"area":null},{"id":"2204.05300","title":"Single-Photon Structured Light","created":"2022-04-11","cited_by_count":8,"area":null},{"id":"2405.02842","title":"IceFormer: Accelerated Inference with Long-Sequence Transformers on CPUs","created":"2024-05-05","cited_by_count":8,"area":null},{"id":"2503.04422","title":"PDX: A Data Layout for Vector Similarity Search","created":"2025-03-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":"2206.01382","title":"Falconn++: A Locality-sensitive Filtering Approach for Approximate Nearest Neighbor Search","created":"2022-06-03","cited_by_count":6,"area":null},{"id":"2505.17810","title":"VIBE: Vector Index Benchmark for Embeddings","created":"2025-05-23","cited_by_count":6,"area":null},{"id":"2308.06111","title":"Improving Zero-Shot Text Matching for Financial Auditing with Large Language Models","created":"2023-08-11","cited_by_count":5,"area":null},{"id":"2312.16335","title":"LeanVec: Searching vectors faster by making them fit","created":"2023-12-26","cited_by_count":5,"area":null},{"id":"2105.01713","title":"A Fast Partial Video Copy Detection Using KNN and Global Feature Database","created":"2021-05-04","cited_by_count":4,"area":null},{"id":"2105.03701","title":"Business Entity Matching with Siamese Graph Convolutional Networks","created":"2021-05-08","cited_by_count":4,"area":null},{"id":"2206.11408","title":"FINGER: Fast Inference for Graph-based Approximate Nearest Neighbor Search","created":"2022-06-22","cited_by_count":4,"area":null},{"id":"2206.14148","title":"Memory Safe Computations with XLA Compiler","created":"2022-06-28","cited_by_count":4,"area":null},{"id":"2312.02429","title":"PEFA: Parameter-Free Adapters for Large-scale Embedding-based Retrieval Models","created":"2023-12-05","cited_by_count":4,"area":null},{"id":"2405.09334","title":"Content-Based Image Retrieval for Multi-Class Volumetric Radiology Images: A Benchmark Study","created":"2024-05-15","cited_by_count":4,"area":null},{"id":"2408.04851","title":"Your Classifier Can Be Secretly a Likelihood-Based OOD Detector","created":"2024-08-09","cited_by_count":4,"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":"2101.10905","title":"Sampling a Near Neighbor in High Dimensions -- Who is the Fairest of Them All?","created":"2021-01-26","cited_by_count":3,"area":null},{"id":"2104.07572","title":"Deep Learning-based Online Alternative Product Recommendations at Scale","created":"2021-04-15","cited_by_count":3,"area":null},{"id":"2109.01531","title":"MACEst: The reliable and trustworthy Model Agnostic Confidence Estimator","created":"2021-09-02","cited_by_count":3,"area":null},{"id":"2305.19435","title":"AdANNS: A Framework for Adaptive Semantic Search","created":"2023-05-30","cited_by_count":3,"area":null},{"id":"2406.02891","title":"A Bi-metric Framework for Fast Similarity Search","created":"2024-06-05","cited_by_count":3,"area":null},{"id":"2412.01940","title":"Down with the Hierarchy: The 'H' in HNSW Stands for \"Hubs\"","created":"2024-12-02","cited_by_count":3,"area":null},{"id":"2101.06428","title":"Hashing and metric learning for charged particle tracking","created":"2021-01-16","cited_by_count":2,"area":null},{"id":"2107.00957","title":"Ascent Similarity Caching with Approximate Indexes","created":"2021-07-02","cited_by_count":2,"area":null},{"id":"2108.09914","title":"Genetic Programming for Manifold Learning: Preserving Local Topology","created":"2021-08-23","cited_by_count":2,"area":null},{"id":"2202.00517","title":"Empirical complexity of comparator-based nearest neighbor descent","created":"2022-01-30","cited_by_count":2,"area":null},{"id":"2305.18356","title":"RT-kNNS Unbound: Using RT Cores to Accelerate Unrestricted Neighbor Search","created":"2023-05-26","cited_by_count":2,"area":null},{"id":"2402.15441","title":"Active Few-Shot Fine-Tuning","created":"2024-02-13","cited_by_count":2,"area":null},{"id":"2403.15807","title":"Efficient Data Access Paths for Mixed Vector-Relational Search","created":"2024-03-23","cited_by_count":2,"area":null},{"id":"2404.19284","title":"Approximate Nearest Neighbour Search on Dynamic Datasets: An Investigation","created":"2024-04-30","cited_by_count":2,"area":null},{"id":"2405.04211","title":"Leveraging Medical Foundation Model Features in Graph Neural Network-Based Retrieval of Breast Histopathology Images","created":"2024-05-07","cited_by_count":2,"area":null},{"id":"2505.12524","title":"HAKES: Scalable Vector Database for Embedding Search Service","created":"2025-05-18","cited_by_count":2,"area":null},{"id":"2510.00566","title":"Panorama: Fast-Track Nearest Neighbors","created":"2025-10-01","cited_by_count":2,"area":null},{"id":"2511.15557","title":"B+ANN: A Fast Billion-Scale Disk-based Nearest-Neighbor Index","created":"2025-11-19","cited_by_count":2,"area":null},{"id":"2603.20009","title":"A Super Fast K-means for Indexing Vector Embeddings","created":"2026-03-20","cited_by_count":2,"area":null},{"id":"2107.06817","title":"Efficient Approximate Search for Sets of Vectors","created":"2021-07-14","cited_by_count":1,"area":null},{"id":"2203.02505","title":"ARM 4-BIT PQ: SIMD-based Acceleration for Approximate Nearest Neighbor Search on ARM","created":"2022-03-03","cited_by_count":1,"area":null},{"id":"2206.08091","title":"Unsupervised Space Partitioning for Nearest Neighbor Search","created":"2022-06-16","cited_by_count":1,"area":null},{"id":"2306.15010","title":"Efficient High-Resolution Template Matching with Vector Quantized Nearest Neighbour Fields","created":"2023-06-26","cited_by_count":1,"area":null},{"id":"2312.01476","title":"Optimizing Context-Enhanced Relational Joins","created":"2023-12-03","cited_by_count":1,"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":"2412.01555","title":"Optimizing Domain-Specific Image Retrieval: A Benchmark of FAISS and Annoy with Fine-Tuned Features","created":"2024-12-02","cited_by_count":1,"area":null},{"id":"2501.02612","title":"Chameleon2++: An Efficient and Scalable Variant Of Chameleon Clustering","created":"2025-01-05","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":"2505.07621","title":"Bang for the Buck: Vector Search on Cloud CPUs","created":"2025-05-12","cited_by_count":1,"area":null},{"id":"2601.21853","title":"LEMUR: Learned Multi-Vector Retrieval","created":"2026-01-29","cited_by_count":1,"area":null},{"id":"2602.16719","title":"GPU-Accelerated Algorithms for Graph Vector Search: Taxonomy, Empirical Study, and Research Directions","created":"2026-02-10","cited_by_count":1,"area":null},{"id":"2603.00537","title":"Mathematical Foundations of Poisoning Attacks on Linear Regression over Cumulative Distribution Functions","created":"2026-02-28","cited_by_count":1,"area":null},{"id":"2102.06525","title":"Leveraging Reinforcement Learning for evaluating Robustness of KNN Search Algorithms","created":"2021-02-10","cited_by_count":0,"area":null},{"id":"2103.09944","title":"IRLI: Iterative Re-partitioning for Learning to Index","created":"2021-03-17","cited_by_count":0,"area":null},{"id":"2103.11773","title":"Computationally Efficient Learning of Statistical Manifolds","created":"2021-02-22","cited_by_count":0,"area":null},{"id":"2110.15089","title":"D2RLIR : an improved and diversified ranking function in interactive recommendation systems based on deep reinforcement learning","created":"2021-10-28","cited_by_count":0,"area":null},{"id":"2301.00200","title":"Logic Mill -- A Knowledge Navigation System","created":"2022-12-31","cited_by_count":0,"area":null},{"id":"2403.10746","title":"Vector search with small radiuses","created":"2024-03-16","cited_by_count":0,"area":null},{"id":"2403.11206","title":"CBR -- Boosting Adaptive Classification By Retrieval of Encrypted Network Traffic with Out-of-distribution","created":"2024-03-17","cited_by_count":0,"area":null},{"id":"2408.14234","title":"FSDEM: Feature Selection Dynamic Evaluation Metric","created":"2024-08-26","cited_by_count":0,"area":null},{"id":"2411.03253","title":"Discovering Data Structures: Nearest Neighbor Search and Beyond","created":"2024-11-05","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":"2505.24608","title":"GARLIC: GAussian Representation LearnIng for spaCe partitioning","created":"2025-05-30","cited_by_count":0,"area":null},{"id":"2506.06557","title":"Infinity Search: Approximate Vector Search with Projections on q-Metric Spaces","created":"2025-06-06","cited_by_count":0,"area":null},{"id":"2508.15436","title":"PLASMA: A Layout-Aware Benchmark Reveals Memory Layout Matters for Graph-based ANNS on GPU","created":"2025-08-21","cited_by_count":0,"area":null},{"id":"2510.14169","title":"JEDA: Query-Free Clinical Order Search from Ambient Dialogues","created":"2025-10-16","cited_by_count":0,"area":null},{"id":"2510.23039","title":"Sublinear Sketches for Approximate Nearest Neighbor and Kernel Density Estimation","created":"2025-10-27","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":"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.10032","title":"HTM-EAR: Importance-Preserving Tiered Memory with Hybrid Routing under Saturation","created":"2026-02-27","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":"2605.00826","title":"Understanding the Performance Plateau in Text-to-Video Retrieval: A Comprehensive Empirical and Linguistic Analysis","created":"2026-03-07","cited_by_count":0,"area":null},{"id":"2605.17415","title":"IVF-TQ: Calibration-Free Streaming Vector Search via a Codebook-Free Residual Layer","created":"2026-05-17","cited_by_count":0,"area":null},{"id":"2605.17524","title":"Covariance Structure and Coordinate Heterogeneity Govern Binary Quantization of Contrastive Embeddings","created":"2026-05-17","cited_by_count":0,"area":null},{"id":"2606.04603","title":"Distributional Approximate Nearest Neighbour Search for Uncertainty-Aware Retrieval","created":"2026-06-03","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.01283","title":"Scaling Laws for Grid-Based Approximate Nearest Neighbor Search in High Dimensions","created":"2026-07-01","cited_by_count":0,"area":null},{"id":"2607.03515","title":"Relevance-Based Embeddings: Lightweight Candidate Retrieval via Heavy-Ranker Calls","created":"2026-07-03","cited_by_count":0,"area":null},{"id":"2607.17582","title":"ANNLib: A Development Framework for Efficient Approximate Nearest Neighbor Search","created":"2026-07-20","cited_by_count":0,"area":null},{"id":"2608.06762","title":"Sub-Quadratic Bisimulation Metrics via Approximate Nearest Neighbors: Coverage-Augmented Guarantees and Computable Two-Sided Certificates","created":"2026-08-07","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.30384","title":"RSLM: Training-Free Vector Quantization for Approximate Nearest Neighbor Search","created":"2026-08-31","cited_by_count":0,"area":null},{"id":"2610.01445","title":"ibUMAP: Coherent and Scalable Field Evaluation for UMAP Optimization","created":"2026-10-01","cited_by_count":0,"area":null}],"next_cursor":null}