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:
- [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
- Efficient LSH-based kernel density estimation☆28Oct 25, 2019Updated 6 years ago
- A study of performance of optimal transport.☆10Jul 4, 2020Updated 6 years ago
- Repository related to the Dynamic Exploration Graph and its previous iterations.☆29Updated this week
- Managed Database hosting by DigitalOcean • AdPostgreSQL, MySQL, MongoDB, Kafka, Valkey, and OpenSearch available. Automatically scale up storage and focus on building your apps.
- ☆17Aug 13, 2026Updated 3 weeks 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
- Code for ICML2020 paper: ''Graph-based Nearest Neighbor Search: From Practice to Theory''☆19Nov 12, 2020Updated 5 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
- High Dimensional Approximate Near(est) Neighbor☆34Sep 5, 2017Updated 9 years ago
- Point-to-Hyperplane NNS Beyond the Unit Hypersphere (SIGMOD 2021)☆13Sep 5, 2021Updated 5 years ago
- 1-Click AI Models by DigitalOcean Gradient • AdDeploy popular AI models on DigitalOcean Gradient GPU virtual machines with just a single click. Zero configuration with optimized deployments.
- Code for ICML2019 paper: Learning to Route in Similarity Graphs☆62Jul 25, 2024Updated 2 years ago
- DartMinHash: Fast Sketching for Weighted Sets☆12Dec 8, 2025Updated 8 months 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
- Reducing Dimensionality method for Nearest Neighbor Search☆15Nov 12, 2020Updated 5 years ago
- Locality sensitive hash functions for Tensorflow 2.0.☆12Feb 18, 2022Updated 4 years ago
- ☆17Oct 13, 2022Updated 3 years ago
- ☆83Jan 7, 2025Updated last year
- ☆15Mar 11, 2021Updated 5 years ago
- Graph Library for Approximate Similarity Search☆146Sep 9, 2025Updated 11 months ago
- Bare Metal GPUs on DigitalOcean Gradient AI • AdPurpose-built for serious AI teams training foundational models, running large-scale inference, and pushing the boundaries of what's possible.
- Code for ECCV2018 paper: Revisiting the Inverted Indices for Billion-Scale Approximate Nearest Neighbors☆218May 7, 2020Updated 6 years ago
- Navigating Spreading-out Graph For Approximate Nearest Neighbor Search☆733Sep 26, 2025Updated 11 months ago
- Official repository for the official implementation of HyperBitT, HyperBitBit64, and HyperTwoBits☆18Oct 15, 2024Updated last year
- This is the source code of the method: DET-LSH (accepted by PVLDB 2024) and PDET-LSH (accepted by TKDE 2026).☆24Jul 29, 2026Updated last month
- Block-based Approximate Nearest Neighbor☆35Nov 1, 2021Updated 4 years ago
- An Effective and Scalable Framework for Multimodal Search of Target Modality☆26Nov 7, 2023Updated 2 years ago
- HyperLogLogLog: Counting Distinct Elements With One Log More☆19May 20, 2022Updated 4 years ago
- ☆16Oct 13, 2020Updated 5 years ago
- [ICLR 2019] ProbGAN: Towards Probabilistic GAN with Theoretical Guarantees☆33Jan 16, 2020Updated 6 years ago
- 1-Click AI Models by DigitalOcean Gradient • AdDeploy popular AI models on DigitalOcean Gradient GPU virtual machines with just a single click. Zero configuration with optimized deployments.
- Code for paper by Bamler & Mandt, "Extreme Classification via Adversarial Softmax Approximation" (ICLR 2020)☆14Apr 8, 2020Updated 6 years ago
- Framework for evaluating ANNS algorithms on billion scale datasets.☆448Jul 13, 2026Updated last month
- SetSketch: Filling the Gap between MinHash and HyperLogLog☆49Aug 11, 2021Updated 5 years ago
- ☆26Apr 1, 2024Updated 2 years ago
- FAst Lookups of Cosine and Other Nearest Neighbors (based on fast locality-sensitive hashing)☆1,159Jun 1, 2024Updated 2 years ago
- ☆85Sep 4, 2024Updated 2 years ago
- Scalable DBSCAN and OPTICS for clustering high-dimensional datasets using random projections☆15Nov 1, 2024Updated last year