{"total":36,"rows":[{"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":"2203.08372","title":"Multi-View Document Representation Learning for Open-Domain Dense Retrieval","created":"2022-03-16","cited_by_count":41,"area":null},{"id":"2111.08366","title":"Multi-Vector Models with Textual Guidance for Fine-Grained Scientific Document Similarity","created":"2021-11-16","cited_by_count":35,"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":"2110.14094","title":"Learning-Augmented $k$-means Clustering","created":"2021-10-27","cited_by_count":26,"area":null},{"id":"2412.04653","title":"Hidden in the Noise: Two-Stage Robust Watermarking for Images","created":"2024-12-05","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":"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":"2103.02729","title":"Linear Bandit Algorithms with Sublinear Time Complexity","created":"2021-03-03","cited_by_count":9,"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":"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":"2103.06447","title":"Self-Supervised Motion Retargeting with Safety Guarantee","created":"2021-03-11","cited_by_count":6,"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":"2306.11550","title":"Query Encoder Distillation via Embedding Alignment is a Strong Baseline Method to Boost Dense Retriever Online Efficiency","created":"2023-06-05","cited_by_count":5,"area":null},{"id":"2411.04257","title":"LSHBloom: Memory-efficient, Extreme-scale Document Deduplication","created":"2024-11-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":"2506.00496","title":"Monitoring Robustness and Individual Fairness","created":"2025-05-31","cited_by_count":3,"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":"2402.01635","title":"Conditional Mean and Variance Estimation via \\textit{k}-NN Algorithm with Automated Variance Selection","created":"2024-02-02","cited_by_count":2,"area":null},{"id":"2411.07983","title":"Gini Coefficient as a Unified Metric for Evaluating Many-versus-Many Similarity in Vector Spaces","created":"2024-11-12","cited_by_count":2,"area":null},{"id":"2206.08091","title":"Unsupervised Space Partitioning for Nearest Neighbor Search","created":"2022-06-16","cited_by_count":1,"area":null},{"id":"2103.05057","title":"Nearest Neighbor Search Under Uncertainty","created":"2021-03-08","cited_by_count":0,"area":null},{"id":"2210.16024","title":"Addressing Bias in Face Detectors using Decentralised Data collection with incentives","created":"2022-10-28","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":"2402.15679","title":"Scalable Density-based Clustering with Random Projections","created":"2024-02-24","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.19865","title":"Beyond Worst-Case Dimensionality Reduction for Sparse Vectors","created":"2025-02-27","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":"2507.22913","title":"A Hybrid Framework for Subject Analysis: Integrating Embedding-Based Regression Models with Large Language Models","created":"2025-07-19","cited_by_count":0,"area":null},{"id":"2508.19449","title":"Stack Trace-Based Crash Deduplication with Transformer Adaptation","created":"2025-08-26","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.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":"2610.04263","title":"Multimodal Dual-Encoder Retrieval for Automated ICD Coding","created":"2026-10-03","cited_by_count":0,"area":null}],"next_cursor":null}