maximum inner product search

HashAttention: Semantic Sparsity for Faster Inference ICML 2025 MUVERA: Multi-Vector Retrieval via Fixed Dimensional Encoding NeurIPS 2024 A Tale of Two Efficient Value Iteration Algorithms for Solving Linear MDPs with Large Action Space AISTATS 2023 Fast Offline Policy Optimization for Large Scale Recommendation AAAI 2023 Knowledge Distillation for High Dimensional Search Index NeurIPS 2023 Query-Aware Quantization for Maximum Inner Product Search AAAI 2023 SAH: Shifting-Aware Asymmetric Hashing for Reverse k Maximum Inner Product Search AAAI 2023 An Efficient Memory-Augmented Transformer for Knowledge-Intensive NLP Tasks EMNLP 2022 Anisotropic Additive Quantization for Fast Inner Product Search AAAI 2022 Linear Bandit Algorithms with Sublinear Time Complexity ICML 2022 Breaking the Linear Iteration Cost Barrier for Some Well-known Conditional Gradient Methods Using MaxIP Data-structures NeurIPS 2021 Dense Hierarchical Retrieval for Open-domain Question Answering EMNLP 2021 Revisiting Wedge Sampling for Budgeted Maximum Inner Product Search (Extended Abstract) IJCAI 2021 Accelerating Large-Scale Inference with Anisotropic Vector Quantization ICML 2020 Differentiable Reasoning over a Virtual Knowledge Base ICLR 2020 MAP Inference for Customized Determinantal Point Processes via Maximum Inner Product Search AISTATS 2020 Norm-Explicit Quantization: Improving Vector Quantization for Maximum Inner Product Search AAAI 2020 Understanding and Improving Proximity Graph Based Maximum Inner Product Search AAAI 2020 A Bandit Approach to Maximum Inner Product Search AAAI 2019 A Fast Sampling Algorithm for Maximum Inner Product Search AISTATS 2019 Efficient Greedy Coordinate Descent for Composite Problems AISTATS 2019 Möbius Transformation for Fast Inner Product Search on Graph NeurIPS 2019 On Efficient Retrieval of Top Similarity Vectors EMNLP 2019 Loss Decomposition for Fast Learning in Large Output Spaces ICML 2018 Non-metric Similarity Graphs for Maximum Inner Product Search NeurIPS 2018