{"total":22,"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":"2106.00882","title":"Efficient Passage Retrieval with Hashing for Open-domain Question Answering","created":"2021-06-02","cited_by_count":53,"area":null},{"id":"2412.14468","title":"HashAttention: Semantic Sparsity for Faster Inference","created":"2024-12-19","cited_by_count":24,"area":null},{"id":"2211.07886","title":"A Survey for Efficient Open Domain Question Answering","created":"2022-11-15","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":"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":"2109.05773","title":"Fast Variational AutoEncoder with Inverted Multi-Index for Collaborative Filtering","created":"2021-09-13","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":"2208.03367","title":"Sublinear Time Algorithm for Online Weighted Bipartite Matching","created":"2022-08-05","cited_by_count":7,"area":null},{"id":"2209.10100","title":"Flashlight: Scalable Link Prediction with Effective Decoders","created":"2022-09-17","cited_by_count":7,"area":null},{"id":"2310.09516","title":"Efficient Link Prediction via GNN Layers Induced by Negative Sampling","created":"2023-10-14","cited_by_count":6,"area":null},{"id":"2208.01191","title":"Implicit Two-Tower Policies","created":"2022-08-02","cited_by_count":3,"area":null},{"id":"2212.07551","title":"Faster Maximum Inner Product Search in High Dimensions","created":"2022-12-14","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":"2208.06874","title":"Fast Vocabulary Projection Method via Clustering for Multilingual Machine Translation on GPU","created":"2022-08-14","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":"2603.08001","title":"Amortized Maximum Inner Product Search with Learned Support Functions","created":"2026-03-09","cited_by_count":1,"area":null},{"id":"2602.03732","title":"Fast-MWEM: Private Data Release in Sublinear Time","created":"2026-02-03","cited_by_count":0,"area":null},{"id":"2606.00809","title":"NBQ: Next-Best-Question for Dynamic Profiling","created":"2026-05-30","cited_by_count":0,"area":null}],"next_cursor":null}