{"total":106,"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":"2110.15343","title":"Scatterbrain: Unifying Sparse and Low-rank Attention Approximation","created":"2021-10-28","cited_by_count":130,"area":null},{"id":"2410.16179","title":"MagicPIG: LSH Sampling for Efficient LLM Generation","created":"2024-10-21","cited_by_count":111,"area":null},{"id":"2101.00408","title":"End-to-End Training of Neural Retrievers for Open-Domain Question Answering","created":"2021-01-02","cited_by_count":75,"area":null},{"id":"2311.08719","title":"Think-in-Memory: Recalling and Post-thinking Enable LLMs with Long-Term Memory","created":"2023-11-15","cited_by_count":64,"area":"lr"},{"id":"2201.05991","title":"Video Transformers: A Survey","created":"2022-01-16","cited_by_count":63,"area":null},{"id":"2108.08842","title":"EDEN: Communication-Efficient and Robust Distributed Mean Estimation for Federated Learning","created":"2021-08-19","cited_by_count":55,"area":null},{"id":"2108.04468","title":"End-to-End User Behavior Retrieval in Click-Through RatePrediction Model","created":"2021-08-10","cited_by_count":45,"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":"2306.01160","title":"Faster Causal Attention Over Large Sequences Through Sparse Flash Attention","created":"2023-06-01","cited_by_count":25,"area":null},{"id":"2205.10249","title":"Sampling Is All You Need on Modeling Long-Term User Behaviors for CTR Prediction","created":"2022-05-20","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":"2209.09004","title":"EcoFormer: Energy-Saving Attention with Linear Complexity","created":"2022-09-19","cited_by_count":21,"area":null},{"id":"2108.11575","title":"Shifted Chunk Transformer for Spatio-Temporal Representational Learning","created":"2021-08-26","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":"2206.14286","title":"TPU-KNN: K Nearest Neighbor Search at Peak FLOP/s","created":"2022-06-28","cited_by_count":18,"area":null},{"id":"2111.09714","title":"You Only Sample (Almost) Once: Linear Cost Self-Attention Via Bernoulli Sampling","created":"2021-11-18","cited_by_count":17,"area":null},{"id":"2210.15497","title":"LSG Attention: Extrapolation of pretrained Transformers to long sequences","created":"2022-10-13","cited_by_count":16,"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":"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":"2409.18721","title":"Scalable Cross-Entropy Loss for Sequential Recommendations with Large Item Catalogs","created":"2024-09-27","cited_by_count":15,"area":null},{"id":"2506.20963","title":"EraRAG: Efficient and Incremental Retrieval Augmented Generation for Growing Corpora","created":"2025-06-26","cited_by_count":15,"area":"rag"},{"id":"2406.15575","title":"Sketch-GNN: Scalable Graph Neural Networks with Sublinear Training Complexity","created":"2024-06-21","cited_by_count":14,"area":null},{"id":"2402.12535","title":"Locality-Sensitive Hashing-Based Efficient Point Transformer with Applications in High-Energy Physics","created":"2024-02-19","cited_by_count":12,"area":null},{"id":"2107.06876","title":"Scalable Optimal Transport in High Dimensions for Graph Distances, Embedding Alignment, and More","created":"2021-07-14","cited_by_count":11,"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":"2408.02354","title":"RECE: Reduced Cross-Entropy Loss for Large-Catalogue Sequential Recommenders","created":"2024-08-05","cited_by_count":9,"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":"2310.03052","title":"Memoria: Resolving Fateful Forgetting Problem through Human-Inspired Memory Architecture","created":"2023-10-04","cited_by_count":8,"area":null},{"id":"2403.07221","title":"LookupFFN: Making Transformers Compute-lite for CPU inference","created":"2024-03-12","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":"2605.13810","title":"Provable Quantization with Randomized Hadamard Transform","created":"2026-05-13","cited_by_count":8,"area":"inference"},{"id":"2108.05433","title":"Learning to Hash Robustly, Guaranteed","created":"2021-08-11","cited_by_count":7,"area":null},{"id":"2205.13341","title":"QUIC-FL: Quick Unbiased Compression for Federated Learning","created":"2022-05-26","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":"2405.18680","title":"Navigable Graphs for High-Dimensional Nearest Neighbor Search: Constructions and Limits","created":"2024-05-29","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":"2208.04461","title":"A Theoretical View on Sparsely Activated Networks","created":"2022-08-08","cited_by_count":6,"area":"moe"},{"id":"2209.07047","title":"iFlipper: Label Flipping for Individual Fairness","created":"2022-09-15","cited_by_count":5,"area":null},{"id":"2602.07397","title":"Scout Before You Attend: Sketch-and-Walk Sparse Attention for Efficient LLM Inference","created":"2026-02-07","cited_by_count":4,"area":"inference"},{"id":"2212.07551","title":"Faster Maximum Inner Product Search in High Dimensions","created":"2022-12-14","cited_by_count":3,"area":null},{"id":"2308.08483","title":"TBIN: Modeling Long Textual Behavior Data for CTR Prediction","created":"2023-08-09","cited_by_count":3,"area":null},{"id":"2401.07119","title":"Curator: Efficient Indexing for Multi-Tenant Vector Databases","created":"2024-01-13","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":"2501.17883","title":"Explainable and Robust Millimeter Wave Beam Alignment for AI-Native 6G Networks","created":"2025-01-23","cited_by_count":3,"area":null},{"id":"2503.01823","title":"Cracking Vector Search Indexes","created":"2025-03-03","cited_by_count":3,"area":"rag"},{"id":"2505.01538","title":"HONEYBEE: Efficient Role-based Access Control for Vector Databases via Dynamic Partitioning[Technical Report]","created":"2025-05-02","cited_by_count":3,"area":null},{"id":"2509.09001","title":"Fast attention mechanisms: a tale of parallelism","created":"2025-09-10","cited_by_count":3,"area":null},{"id":"2604.19528","title":"Revisiting RaBitQ and TurboQuant: A Symmetric Comparison of Methods, Theory, and Experiments","created":"2026-04-21","cited_by_count":3,"area":null},{"id":"2210.05899","title":"A Lower Bound of Hash Codes' Performance","created":"2022-10-12","cited_by_count":2,"area":null},{"id":"2308.07418","title":"Locally Adaptive and Differentiable Regression","created":"2023-08-14","cited_by_count":2,"area":null},{"id":"2311.13657","title":"Efficient Transformer Knowledge Distillation: A Performance Review","created":"2023-11-22","cited_by_count":2,"area":"distill"},{"id":"2502.15900","title":"Explaining the Success of Nearest Neighbor Methods in Prediction","created":"2025-02-21","cited_by_count":2,"area":null},{"id":"2505.20274","title":"Probabilistic Kernel Function for Fast Angle Testing","created":"2025-05-26","cited_by_count":2,"area":null},{"id":"2507.14180","title":"Digital Twin-Assisted Explainable AI for Robust Beam Prediction in mmWave MIMO Systems","created":"2025-07-12","cited_by_count":2,"area":null},{"id":"2507.21989","title":"Benchmarking Filtered Approximate Nearest Neighbor Search Algorithms on Transformer-based Embedding Vectors","created":"2025-07-29","cited_by_count":2,"area":"rag"},{"id":"2508.19740","title":"Spotlight Attention: Towards Efficient LLM Generation via Non-linear Hashing-based KV Cache Retrieval","created":"2025-08-27","cited_by_count":2,"area":"inference"},{"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":"2107.06817","title":"Efficient Approximate Search for Sets of Vectors","created":"2021-07-14","cited_by_count":1,"area":null},{"id":"2112.07836","title":"Communication-Efficient Distributed SGD with Compressed Sensing","created":"2021-12-15","cited_by_count":1,"area":null},{"id":"2201.07917","title":"Similarity search on neighbor's graphs with automatic Pareto optimal performance and minimum expected quality setups based on hyperparameter optimization","created":"2022-01-19","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":"2211.12751","title":"SAH: Shifting-aware Asymmetric Hashing for Reverse $k$-Maximum Inner Product Search","created":"2022-11-23","cited_by_count":1,"area":null},{"id":"2306.02563","title":"Large-Scale Distributed Learning via Private On-Device Locality-Sensitive Hashing","created":"2023-06-05","cited_by_count":1,"area":null},{"id":"2307.10443","title":"Integrating a Heterogeneous Graph with Entity-aware Self-attention using Relative Position Labels for Reading Comprehension Model","created":"2023-07-19","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":"2408.09380","title":"ELASTIC: Efficient Linear Attention for Sequential Interest Compression","created":"2024-08-18","cited_by_count":1,"area":null},{"id":"2510.12811","title":"Applying Graph Analysis for Unsupervised Fast Malware Fingerprinting","created":"2025-10-07","cited_by_count":1,"area":null},{"id":"2601.22269","title":"JAF: Judge Agent Forest","created":"2026-01-29","cited_by_count":1,"area":"lr"},{"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":"2605.01263","title":"New Bounds for Kernel Sums via Fast Spherical Embeddings","created":"2026-05-02","cited_by_count":1,"area":null},{"id":"2605.09472","title":"Positional LSH: Binary Block Matrix Approximation for Attention with Linear Biases","created":"2026-05-10","cited_by_count":1,"area":null},{"id":"2608.25735","title":"Pointing the Way, Hiding the Destination: Practical Private Dense Retrieval at Scale","created":"2026-08-26","cited_by_count":1,"area":"rag"},{"id":"2101.11685","title":"CNN with large memory layers","created":"2021-01-27","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.10024","title":"Efficient Algorithms for Rotation Averaging Problems","created":"2021-03-18","cited_by_count":0,"area":null},{"id":"2107.00222","title":"Deep auxiliary learning for visual localization using colorization task","created":"2021-07-01","cited_by_count":0,"area":null},{"id":"2111.14219","title":"Approximate Inference via Clustering","created":"2021-11-28","cited_by_count":0,"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":"2305.06492","title":"Treasure What You Have: Exploiting Similarity in Deep Neural Networks for Efficient Video Processing","created":"2023-05-10","cited_by_count":0,"area":null},{"id":"2402.07189","title":"Improving LSH via Tensorized Random Projection","created":"2024-02-11","cited_by_count":0,"area":null},{"id":"2402.13397","title":"Xling: A Learned Filter Framework for Accelerating High-Dimensional Approximate Similarity Join","created":"2024-02-20","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":"2407.07096","title":"Spectral Toolkit of Algorithms for Graphs: Technical Report (2)","created":"2024-06-06","cited_by_count":0,"area":null},{"id":"2410.23805","title":"UpANNS: Enhancing Billion-Scale ANNS Efficiency with Real-World PIM Architecture","created":"2024-10-31","cited_by_count":0,"area":"rag"},{"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.17844","title":"Locality-Sensitive Hashing for Efficient Hard Negative Sampling in Contrastive Learning","created":"2025-05-23","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":"2508.02989","title":"Scalable Varied-Density Clustering via Graph Propagation","created":"2025-08-05","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.22479","title":"Contextual Tokenization for Graph Inverted Indices","created":"2025-10-26","cited_by_count":0,"area":null},{"id":"2512.00927","title":"LAHNet: Local Attentive Hashing Network for Point Cloud Registration","created":"2025-11-30","cited_by_count":0,"area":null},{"id":"2512.18060","title":"Graph-based Nearest Neighbors with Dynamic Updates via Random Walks","created":"2025-12-19","cited_by_count":0,"area":"rag"},{"id":"2602.16124","title":"Rethinking ANN-based Retrieval: Multifaceted Learnable Index for Large-scale Recommendation System","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.06660","title":"Approximate Nearest Neighbor Search for Modern AI: A Projection-Augmented Graph Approach","created":"2026-03-01","cited_by_count":0,"area":null},{"id":"2604.00779","title":"Using predefined vector systems to speed up neural network multimillion class classification","created":"2026-04-01","cited_by_count":0,"area":null},{"id":"2605.07770","title":"FAVOR: Efficient Filter-Agnostic Vector ANNS Based on Selectivity-Aware Exclusion Distances","created":"2026-05-08","cited_by_count":0,"area":"rag"}],"next_cursor":"100"}