dbaranchuk / learning-to-routeLinks
Code for ICML2019 paper: Learning to Route in Similarity Graphs
☆58Updated last year
Alternatives and similar repositories for learning-to-route
Users that are interested in learning-to-route are comparing it to the libraries listed below
Sorting:
- Code for paper: Towards Similarity Graphs Constructed by Deep Reinforcement Learning☆21Updated 5 years ago
- Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search☆40Updated 6 years ago
- Neural LSH [ICLR 2020] - Using supervised learning to produce better space partitions for fast nearest neighbor search.☆73Updated 4 years ago
- Supplementary Code for Unsupervised Neural Quantization for Compressed-Domain Similarity Search☆36Updated 5 years ago
- Implementation of vector quantization algorithms, codes for Norm-Explicit Quantization: Improving Vector Quantization for Maximum Inner P…☆59Updated 4 years ago
- Fast search algorithm for product-quantized codes via hash-tables☆53Updated 7 years ago
- Code for ECCV2018 paper: Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighbors☆212Updated 5 years ago
- Benchmark of Nearest Neighbor Search on High Dimensional Data☆208Updated 4 years ago
- Search with a hash index☆33Updated 6 years ago
- Source code for SIGMOD 2020 paper "Improving Approximate Nearest Neighbor Search through Learned Adaptive Early Termination"☆56Updated 5 years ago
- Source code for learning and evaluation different quantzation methods☆26Updated 10 years ago
- High Dimensional Approximate Near(est) Neighbor☆33Updated 7 years ago
- PQ Fast Scan☆64Updated 6 years ago
- Query-Aware LSH for Approximate NNS (PVLDB 2015 and VLDBJ 2017)☆29Updated 4 years ago
- A compressed adaptive optimizer for training large-scale deep learning models using PyTorch☆27Updated 5 years ago
- ☆31Updated 7 years ago
- One-Shot Learning using Nearest-Neighbor Search (NNS) and Locality-Sensitive Hashing LSH☆74Updated 7 years ago
- QuickerADC is an implementation of highly-efficient product quantizers leveraging SIMD shuffle instructions integrated into FAISS☆61Updated 6 years ago
- To Index or Not to Index: Optimizing Exact Maximum Inner Product Search☆26Updated 6 years ago
- an Extremely Fast Approximate Nearest Neighbor graph construction Algorithm framework☆96Updated 5 years ago
- Cartesian k-means for approximate nearest neghbor search, codebook learning, etc.☆51Updated 11 years ago
- Differentiable Product Quantization for End-to-End Embedding Compression.☆62Updated 2 years ago
- ☆13Updated 6 years ago
- Open source implementation of "Spreading Vectors for Similarity Search"☆320Updated 3 years ago
- Pure python implementation of product quantization for nearest neighbor search☆353Updated last month
- SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index☆55Updated 10 years ago
- Code accompanying the paper "Learning Permutations with Sinkhorn Policy Gradient"☆39Updated 6 years ago
- Kmeans Quantization + Random Projection based Locality Sensitive Hashing☆28Updated 6 years ago
- LSH-GPU ANN package☆94Updated 6 years ago
- Large Scale Graphical Model☆24Updated 6 years ago