{"total":37,"rows":[{"id":"2401.08281","title":"The Faiss library","created":"2024-01-16","cited_by_count":376,"area":null},{"id":"2310.17157","title":"Deja Vu: Contextual Sparsity for Efficient LLMs at Inference Time","created":"2023-10-26","cited_by_count":252,"area":null},{"id":"2410.16179","title":"MagicPIG: LSH Sampling for Efficient LLM Generation","created":"2024-10-21","cited_by_count":111,"area":null},{"id":"2310.11703","title":"A Comprehensive Survey on Vector Database: Storage and Retrieval Technique, Challenge","created":"2023-10-18","cited_by_count":55,"area":null},{"id":"2110.04622","title":"Does Preprocessing Help Training Over-parameterized Neural Networks?","created":"2021-10-09","cited_by_count":32,"area":null},{"id":"2211.14227","title":"Bypass Exponential Time Preprocessing: Fast Neural Network Training via Weight-Data Correlation Preprocessing","created":"2022-11-25","cited_by_count":29,"area":null},{"id":"2111.15139","title":"Breaking the Linear Iteration Cost Barrier for Some Well-known Conditional Gradient Methods Using MaxIP Data-structures","created":"2021-11-30","cited_by_count":19,"area":null},{"id":"2105.08285","title":"Sublinear Least-Squares Value Iteration via Locality Sensitive Hashing","created":"2021-05-18","cited_by_count":15,"area":null},{"id":"2305.08367","title":"Toward Highly Efficient and Private Submodular Maximization via Matrix-Based Acceleration","created":"2023-05-15","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":"2112.05872","title":"SLOSH: Set LOcality Sensitive Hashing via Sliced-Wasserstein Embeddings","created":"2021-12-11","cited_by_count":9,"area":null},{"id":"2206.10477","title":"Survival Kernets: Scalable and Interpretable Deep Kernel Survival Analysis with an Accuracy Guarantee","created":"2022-06-21","cited_by_count":9,"area":null},{"id":"2206.14354","title":"Hardness and Algorithms for Robust and Sparse Optimization","created":"2022-06-29","cited_by_count":8,"area":null},{"id":"2108.05433","title":"Learning to Hash Robustly, Guaranteed","created":"2021-08-11","cited_by_count":7,"area":null},{"id":"2208.03367","title":"Sublinear Time Algorithm for Online Weighted Bipartite Matching","created":"2022-08-05","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":"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":"2307.03043","title":"A Near-Linear Time Algorithm for the Chamfer Distance","created":"2023-07-06","cited_by_count":5,"area":null},{"id":"2306.11312","title":"Data Structures for Density Estimation","created":"2023-06-20","cited_by_count":4,"area":null},{"id":"2502.01528","title":"SQUASH: Serverless and Distributed Quantization-based Attributed Vector Similarity Search","created":"2025-02-03","cited_by_count":3,"area":null},{"id":"2206.07826","title":"Metric-Fair Classifier Derandomization","created":"2022-06-15","cited_by_count":2,"area":null},{"id":"2502.15900","title":"Explaining the Success of Nearest Neighbor Methods in Prediction","created":"2025-02-21","cited_by_count":2,"area":null},{"id":"2212.02635","title":"Stars: Tera-Scale Graph Building for Clustering and Graph Learning","created":"2022-12-05","cited_by_count":1,"area":null},{"id":"2303.17727","title":"BOLT: An Automated Deep Learning Framework for Training and Deploying Large-Scale Search and Recommendation Models on Commodity CPU Hardware","created":"2023-03-30","cited_by_count":1,"area":null},{"id":"2112.10919","title":"Provable Hierarchical Lifelong Learning with a Sketch-based Modular Architecture","created":"2021-12-21","cited_by_count":0,"area":null},{"id":"2302.00003","title":"The Power of External Memory in Increasing Predictive Model Capacity","created":"2023-01-31","cited_by_count":0,"area":null},{"id":"2311.02573","title":"Group Testing for Accurate and Efficient Range-Based Near Neighbor Search for Plagiarism Detection","created":"2023-11-05","cited_by_count":0,"area":null},{"id":"2311.11429","title":"Fast Heavy Inner Product Identification Between Weights and Inputs in Neural Network Training","created":"2023-11-19","cited_by_count":0,"area":null},{"id":"2407.07096","title":"Spectral Toolkit of Algorithms for Graphs: Technical Report (2)","created":"2024-06-06","cited_by_count":0,"area":null},{"id":"2407.11217","title":"Faster and Simpler Greedy Algorithm for $k$-Median and $k$-Means","created":"2024-07-15","cited_by_count":0,"area":null},{"id":"2508.06774","title":"Approximating High-Dimensional Earth Mover's Distance as Fast as Closest Pair","created":"2025-08-09","cited_by_count":0,"area":null},{"id":"2510.22479","title":"Contextual Tokenization for Graph Inverted Indices","created":"2025-10-26","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":"2604.17104","title":"TensorDex: A Compact, Tensor-Centric Storage System for Modern AI Models","created":"2026-04-18","cited_by_count":0,"area":null},{"id":"2607.06148","title":"RFHNet: Relational and Frequency-Aware Hashing Network for Large-Scale Fine-Grained Food Image Retrieval","created":"2026-07-07","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":"2609.03079","title":"LeanStream: A Speculate-and-Refine Streaming Framework for Efficient on-Device LLM Inference","created":"2026-09-02","cited_by_count":0,"area":null}],"next_cursor":null}