approximate search

DESSERT: An Efficient Algorithm for Vector Set Search with Vector Set Queries NeurIPS 2023 Don’t Mess with Mister-in-Between: Improved Negative Search for Knowledge Graph Completion EACL 2023 Query-Aware Quantization for Maximum Inner Product Search AAAI 2023 Anisotropic Additive Quantization for Fast Inner Product Search AAAI 2022 Boosted Dense Retriever NAACL 2022 Revisiting Wedge Sampling for Budgeted Maximum Inner Product Search (Extended Abstract) IJCAI 2021 Understanding and Improving Proximity Graph Based Maximum Inner Product Search AAAI 2020 Learning a Complete Image Indexing Pipeline CVPR 2018 Sampling for Approximate Maximum Search in Factorized Tensor IJCAI 2017 Sparse Randomized Partition Trees for Nearest Neighbor Search AISTATS 2017 Quantization based Fast Inner Product Search AISTATS 2016 Shortlist Selection With Residual-Aware Distance Estimator for K-Nearest Neighbor Search CVPR 2016 Asymmetric LSH (ALSH) for Sublinear Time Maximum Inner Product Search (MIPS) NeurIPS 2014 Distance Encoded Product Quantization CVPR 2014 Learning Hash Codes with Listwise Supervision ICCV 2013 Learning to Prune in Metric and Non-Metric Spaces NeurIPS 2013 The Power of Asymmetry in Binary Hashing NeurIPS 2013 Isotropic Hashing NeurIPS 2012 Rank-Approximate Nearest Neighbor Search: Retaining Meaning and Speed in High Dimensions NeurIPS 2009