brtholomy / hnswLinks
HNSW tutorial
☆149Updated last year
Alternatives and similar repositories for hnsw
Users that are interested in hnsw are comparing it to the libraries listed below
Sorting:
- ☆692Updated last week
- build your own vector database -- the littlest hnsw☆61Updated 7 months ago
- Bridging the Gap Between Semantic and Interaction Similarity in Recommender Systems☆105Updated 4 months ago
- Implementation of the paper "Lossless Compression of Vector IDs for Approximate Nearest Neighbor Search" by Severo et al.☆82Updated 7 months ago
- Lightweight Nearest Neighbors with Flexible Backends☆298Updated last month
- Heirarchical Navigable Small Worlds☆101Updated 2 weeks ago
- The Fast Vector Similarity Library is designed to provide efficient computation of various similarity measures between vectors.☆402Updated 6 months ago
- ☆401Updated this week
- ☆163Updated last year
- A pure NumPy implementation of Mamba.☆224Updated last year
- A Detailed Introduction to My Favorite Statistical Measure, Hoeffding's D☆98Updated last year
- Neural Search☆363Updated 5 months ago
- A GPU Accelerated Binary Vector Store☆47Updated 6 months ago
- Radient turns many data types (not just text) into vectors for similarity search, RAG, regression analysis, and more.☆279Updated last week
- Absolute minimalistic implementation of a GPT-like transformer using only numpy (<650 lines).☆253Updated last year
- UniSim is a package for efficient similarity computation, fuzzy matching, and clustering of data.☆139Updated 4 months ago
- Pytorch script hot swap: Change code without unloading your LLM from VRAM☆126Updated 4 months ago
- Fast, SQL powered, in-process vector search for any language with an SQLite driver☆319Updated 9 months ago
- LLM Analytics☆676Updated 10 months ago
- ⚡ Faster similarity search with PDX: A vertical data layout for vectors☆54Updated 2 weeks ago
- Graph Library for Approximate Similarity Search☆129Updated last month
- Tree-based indexes for neural-search☆32Updated last year
- High-performance MinHash implementation in Rust with Python bindings for efficient similarity estimation and deduplication of large datas…☆199Updated last month
- Baguetter is a flexible, efficient, and hackable search engine library implemented in Python. It's designed for quickly benchmarking, imp…☆188Updated 11 months ago
- cuVS - a library for vector search and clustering on the GPU☆496Updated this week
- Bayesian Optimization as a Coverage Tool for Evaluating LLMs. Accurate evaluation (benchmarking) that's 10 times faster with just a few l…☆286Updated 3 weeks ago
- ☆249Updated last year
- XTR/WARP (SIGIR'25) is an extremely fast and accurate retrieval engine based on Stanford's ColBERTv2/PLAID and Google DeepMind's XTR.☆154Updated 3 months ago
- Official codebase for the paper "Beyond A* Better Planning with Transformers via Search Dynamics Bootstrapping".☆373Updated last year
- A complete end-to-end pipeline for LLM interpretability with sparse autoencoders (SAEs) using Llama 3.2, written in pure PyTorch and full…☆622Updated 5 months ago