{"total":59,"rows":[{"id":"2401.08281","title":"The Faiss library","created":"2024-01-16","cited_by_count":376,"area":null},{"id":"2409.10516","title":"RetrievalAttention: Accelerating Long-Context LLM Inference via Vector Retrieval","created":"2024-09-16","cited_by_count":116,"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":"2410.14462","title":"LUDVIG: Learning-Free Uplifting of 2D Visual Features to Gaussian Splatting Scenes","created":"2024-10-18","cited_by_count":37,"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":"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":"2310.19126","title":"Worst-case Performance of Popular Approximate Nearest Neighbor Search Implementations: Guarantees and Limitations","created":"2023-10-29","cited_by_count":20,"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":"2408.08933","title":"RoarGraph: A Projected Bipartite Graph for Efficient Cross-Modal Approximate Nearest Neighbor Search","created":"2024-08-16","cited_by_count":12,"area":null},{"id":"2108.04526","title":"A Survey on Deep Reinforcement Learning for Data Processing and Analytics","created":"2021-08-10","cited_by_count":10,"area":null},{"id":"2210.06294","title":"Indoor Localization with Robust Global Channel Charting: A Time-Distance-Based Approach","created":"2022-10-07","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":"2203.13601","title":"Navigable Proximity Graph-Driven Native Hybrid Queries with Structured and Unstructured Constraints","created":"2022-03-25","cited_by_count":7,"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":"2110.14007","title":"TOD: GPU-accelerated Outlier Detection via Tensor Operations","created":"2021-10-26","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":"2312.16335","title":"LeanVec: Searching vectors faster by making them fit","created":"2023-12-26","cited_by_count":5,"area":null},{"id":"2504.04698","title":"scAgent: Universal Single-Cell Annotation via a LLM Agent","created":"2025-04-07","cited_by_count":5,"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":"2406.19651","title":"CANDY: A Benchmark for Continuous Approximate Nearest Neighbor Search with Dynamic Data Ingestion","created":"2024-06-28","cited_by_count":4,"area":null},{"id":"2502.16813","title":"Snoopy: Effective and Efficient Semantic Join Discovery via Proxy Columns","created":"2025-02-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":"2312.03940","title":"PECANN: Parallel Efficient Clustering with Graph-Based Approximate Nearest Neighbor Search","created":"2023-12-06","cited_by_count":3,"area":null},{"id":"2402.11354","title":"Probabilistic Routing for Graph-Based Approximate Nearest Neighbor Search","created":"2024-02-17","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":"2502.11246","title":"MemeSense: An Adaptive In-Context Framework for Social Commonsense Driven Meme Moderation","created":"2025-02-16","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":"2509.03228","title":"NeurStore: Efficient In-database Deep Learning Model Management System","created":"2025-09-03","cited_by_count":2,"area":null},{"id":"2602.05062","title":"Scaling Laws for Embedding Dimension in Information Retrieval","created":"2026-02-04","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":"2310.08891","title":"EHI: End-to-end Learning of Hierarchical Index for Efficient Dense Retrieval","created":"2023-10-13","cited_by_count":1,"area":null},{"id":"2401.12672","title":"ChatGraph: Chat with Your Graphs","created":"2024-01-23","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":"2405.03651","title":"Adaptive Retrieval and Scalable Indexing for k-NN Search with Cross-Encoders","created":"2024-05-06","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":"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":"2511.19324","title":"What Drives Cross-lingual Ranking? Retrieval Approaches with Multilingual Language Models","created":"2025-11-24","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":"2609.07956","title":"Streaming Hierarchical Inference with Tabular Foundation Models","created":"2026-09-07","cited_by_count":1,"area":null},{"id":"2407.13326","title":"RISC-V RVV efficiency for ANN algorithms","created":"2024-07-18","cited_by_count":0,"area":null},{"id":"2411.14006","title":"Experimental comparison of graph-based approximate nearest neighbor search algorithms on edge devices","created":"2024-11-21","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":"2502.11490","title":"GPU-accelerated Multi-relational Parallel Graph Retrieval for Web-scale Recommendations","created":"2025-02-17","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":"2506.20584","title":"The kernel of graph indices for vector search","created":"2025-06-25","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":"2509.18471","title":"Individualized non-uniform quantization for vector search","created":"2025-09-22","cited_by_count":0,"area":null},{"id":"2509.22931","title":"MonoCon: A general framework for learning ultra-compact high-fidelity representations using monotonicity constraints","created":"2025-09-26","cited_by_count":0,"area":null},{"id":"2510.10123","title":"The Hybrid Multimodal Graph Index (HMGI): A Comprehensive Framework for Integrated Relational and Vector Search","created":"2025-10-11","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":"2604.04603","title":"Cardinality Estimation for High Dimensional Similarity Queries with Adaptive Bucket Probing","created":"2026-04-06","cited_by_count":0,"area":null},{"id":"2605.07130","title":"Simple KNN-Based Outlier Detection Achieves Robust Clustering","created":"2026-05-08","cited_by_count":0,"area":null},{"id":"2605.14343","title":"Nearest-Neighbor Radii under Dependent Sampling","created":"2026-05-14","cited_by_count":0,"area":null},{"id":"2605.27066","title":"Large Language Model-Powered Query-Driven Event Timeline Summarization in Industrial Search","created":"2026-05-26","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},{"id":"2609.02143","title":"A Power Law in Logarithm's Clothing: On the Scalability of Graph-Based Vector Search","created":"2026-09-02","cited_by_count":0,"area":null},{"id":"2609.31731","title":"GERIS: A Game-Theoretic Framework for Filtering Instance-Dependent Label Noise in License Plate Data Augmentation","created":"2026-09-22","cited_by_count":0,"area":null}],"next_cursor":null}