Neural LSH [ICLR 2020] - Using supervised learning to produce better space partitions for fast nearest neighbor search.
☆73Jan 20, 2021Updated 5 years ago
Alternatives and similar repositories for learn-to-hash
Users that are interested in learn-to-hash are comparing it to the libraries listed below. We may earn a commission when you buy through links labeled 'Ad' on this page.
Sorting:
- fast kernel evaluation in high dimensions via hashing☆25Oct 21, 2020Updated 5 years ago
- [NeurIPS 2019 Spotlight] High dimensional mean estimation and outlier detection in nearly-linear time.☆26Oct 11, 2019Updated 6 years ago
- ☆13Feb 11, 2019Updated 7 years ago
- Supplementary Code for Unsupervised Neural Quantization for Compressed-Domain Similarity Search☆36Aug 15, 2019Updated 7 years ago
- Repository related to the Dynamic Exploration Graph and its previous iterations.☆29Updated this week
- Deploy to Railway using AI coding agents - Free Credits Offer • AdUse Claude Code, Codex, OpenCode, and more. Autonomous software development now has the infrastructure to match with Railway.
- DESSERT Effeciently Searches Sets of Embeddings via Retrieval Tables☆18Feb 21, 2024Updated 2 years ago
- PQ Fast Scan☆70May 31, 2019Updated 7 years ago
- Open source implementation of "Spreading Vectors for Similarity Search"☆322Aug 13, 2021Updated 5 years ago
- A fast high dimensional near neighbor search algorithm based on group testing and locality sensitive hashing☆23Dec 9, 2023Updated 2 years ago
- Learning-based Approximate k-NN Search in Graph Databases☆11Nov 29, 2021Updated 4 years ago
- The source code for PM-LSH (PVLDB 2020)☆13Nov 30, 2024Updated last year
- Code for ICML2019 paper: Learning to Route in Similarity Graphs☆62Jul 25, 2024Updated 2 years ago
- Falconn++ is a locality-sensitive filtering (LSF) approach, built on top of cross-polytope LSH (FalconnLib) to answer approximate nearest…☆12Aug 5, 2024Updated 2 years ago
- VLDB 2024 paper repo. RoarGraph: A Projected Bipartite Graph for Efficient Cross-Modal Approximate Nearest Neighbor Search☆62Sep 16, 2024Updated last year
- Managed Database hosting by DigitalOcean • AdPostgreSQL, MySQL, MongoDB, Kafka, Valkey, and OpenSearch available. Automatically scale up storage and focus on building your apps.
- Locality sensitive hash functions for Tensorflow 2.0.☆12Feb 18, 2022Updated 4 years ago
- ☆17Oct 13, 2022Updated 3 years ago
- ☆82Jan 7, 2025Updated last year
- Parameterless and Universal FInding of Nearest Neighbors☆60Mar 13, 2025Updated last year
- BC-Tree and Ball-Tree for Point-to-Hyperplane NNS (ICDE 2023)☆17Aug 4, 2023Updated 3 years ago
- A tiny approximate K-Nearest Neighbour library in Python based on Fast Product Quantization and IVF☆18Apr 27, 2023Updated 3 years ago
- This is a source code for LSH-APG (PVLDB 2023)☆33Aug 21, 2024Updated last year
- ☆15Mar 11, 2021Updated 5 years ago
- ☆23May 30, 2025Updated last year
- Virtual machines for every use case on DigitalOcean • AdGet dependable uptime with 99.99% SLA, simple security tools, and predictable monthly pricing with DigitalOcean's virtual machines, called Droplets.
- Graph Library for Approximate Similarity Search☆145Sep 9, 2025Updated 11 months ago
- Navigating Spreading-out Graph For Approximate Nearest Neighbor Search☆734Sep 26, 2025Updated 10 months ago
- Official repository for the official implementation of HyperBitT, HyperBitBit64, and HyperTwoBits☆17Oct 15, 2024Updated last year
- Matlab code for tree-Wasserstein distance in the paper "Tree-Sliced Variants of Wasserstein Distances", NeurIPS, 2019. (Tam Le, Makoto Y…☆11Mar 11, 2020Updated 6 years ago
- Fast search algorithm for product-quantized codes via hash-tables☆54Jul 3, 2018Updated 8 years ago
- Block-based Approximate Nearest Neighbor☆35Nov 1, 2021Updated 4 years ago
- [NeurIPS'24] Approximate Nearest Neighbor search using reduced-rank regression, with extremely fast queries, tiny memory usage, and rapid…☆52Aug 7, 2026Updated last week
- This is the implementation of the Hierarquical Clustering-based Nearest Neighbor Graphs☆22Feb 6, 2020Updated 6 years ago
- [ICLR 2019] ProbGAN: Towards Probabilistic GAN with Theoretical Guarantees☆33Jan 16, 2020Updated 6 years ago
- GPU virtual machines on DigitalOcean Gradient AI • AdGet to production fast with high-performance AMD and NVIDIA GPUs you can spin up in seconds. The definition of operational simplicity.
- Code for paper by Bamler & Mandt, "Extreme Classification via Adversarial Softmax Approximation" (ICLR 2020)☆14Apr 8, 2020Updated 6 years ago
- A fast header-only graph-based index for approximate nearest neighbor search (ANNS). https://flatnav.net☆48Jun 4, 2026Updated 2 months ago
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Aug 11, 2021Updated 5 years ago
- FAst Lookups of Cosine and Other Nearest Neighbors (based on fast locality-sensitive hashing)☆1,159Jun 1, 2024Updated 2 years ago
- Code for our NeurIPS 2019 *spotlight* "Provably Robust Deep Learning via Adversarially Trained Smoothed Classifiers"☆229Nov 9, 2019Updated 6 years ago
- Fast non-cryptographic hash, with the benchmarks to prove it.☆20Jun 19, 2023Updated 3 years ago
- 🏆 Winning NeurIPS (NIPS) Competition Track: Big ANN, Practical Vector Search Challenge 2023. （see big-ann-benchmark https://big-ann-benc…☆30Aug 16, 2024Updated 2 years ago