Alternatives and similar repositories for rehashing

Users that are interested in rehashing are comparing it to the libraries listed below

• rdspring1 / MISSION
  MISSION: Ultra Large-Scale Feature Selection using Count-Sketches
  ☆13Updated 5 years ago
• twistedcubic / learn-to-hash
  Neural LSH [ICLR 2020] - Using supervised learning to produce better space partitions for fast nearest neighbor search.
  ☆73Updated 4 years ago
• rasmus-pagh / coveringLSH
  Simple implementation of CoveringLSH
  ☆10Updated 9 years ago
• puffinn / puffinn
  Parameterless and Universal FInding of Nearest Neighbors
  ☆60Updated 2 months ago
• dnbaker / frp
  FRP: Fast Random Projections
  ☆43Updated 5 years ago
• stanford-futuredata / optimus-maximus
  To Index or Not to Index: Optimizing Exact Maximum Inner Product Search
  ☆26Updated 6 years ago
• twistedcubic / que-outlier-detection
  [NeurIPS 2019 Spotlight] High dimensional mean estimation and outlier detection in nearly-linear time.
  ☆26Updated 5 years ago
• stanford-futuredata / wmsketch
  Sketching linear classifiers over data streams with the Weight-Median Sketch (SIGMOD 2018).
  ☆38Updated 6 years ago
• ilyaraz / ot_estimators
  Implementations of several fast approximate algorithms for geometric optimal transport (OT)
  ☆118Updated 5 years ago
• talwagner / efficient_kde
  Efficient LSH-based kernel density estimation
  ☆29Updated 5 years ago
• talwagner / quadsketch
  Implementation of QuadSketch algorithm
  ☆11Updated 2 years ago
• gsamaras / Dolphinn
  High Dimensional Approximate Near(est) Neighbor
  ☆33Updated 7 years ago
• DBAIWangGroup / SRS
  SRS - Fast Approximate Nearest Neighbor Search in High Dimensional Euclidean Space With a Tiny Index
  ☆55Updated 10 years ago
• edoliberty / frequent-directions
  Implements the frequent directions algorithm for approximating matrices in streams
  ☆32Updated 7 years ago
• idiap / eakmeans
  Implementation of fast exact k-means algorithms
  ☆45Updated 5 years ago
• optml / CoCoA
  ☆19Updated 7 years ago
• rdspring1 / Count-Sketch-Optimizers
  A compressed adaptive optimizer for training large-scale deep learning models using PyTorch
  ☆27Updated 5 years ago
• xdata-skylark / libskylark
  Sketching-based Distributed Matrix Computations for Machine Learning
  ☆100Updated 7 years ago
• epfml / cola
  CoLa - Decentralized Linear Learning: https://arxiv.org/abs/1808.04883
  ☆20Updated 3 years ago
• JoshEngels / FLINNG
  A fast high dimensional near neighbor search algorithm based on group testing and locality sensitive hashing
  ☆23Updated last year
• djsutherland / igms
  Implicit generative models and related stuff based on the MMD, in PyTorch
  ☆16Updated 4 years ago
• brekelma / echo
  Echo Noise Channel for Exact Mutual Information Calculation
  ☆17Updated 4 years ago
• jermp / 2i_bench
  A C++ library to benchmark inverted indexes.
  ☆20Updated 4 years ago
• dbaranchuk / learning-to-route
  Code for ICML2019 paper: Learning to Route in Similarity Graphs
  ☆58Updated 10 months ago
• manzilzaheer / CoverTree
  Cover Tree implementation in C++ for k-Nearest Neighbours and range search
  ☆93Updated 4 years ago
• tsoernes / gfsopt
  Convenient hyperparameter optimization
  ☆14Updated last year
• doubling / Stochastic_Generative_Hashing
  ☆25Updated 6 years ago
• salviati / slash
  A locality-sensitive hashing library
  ☆46Updated 11 years ago
• stanis-morozov / ip-nsw
  Implementation of ip-nsw from Non-metric Similarity Graphs for Maximum Inner Product Search
  ☆39Updated 6 years ago
• PrincetonLIPS / randomized_telescopes
  Code for "Efficient optimization of loops and limits with randomized telescoping sums"
  ☆27Updated 6 years ago