HNSW is an efficient ANN search algorithm
Hierarchical navigable small world
HNSW is an efficient ANN search algorithm
The multi-layered graph structure of HNSW allows for both rough and detailed searches, optimizing the balance between speed and accuracy. This hierarchical method significantly reduces the computational complexity compared to traditional methods that compare the query with every item individually.
Remember this
HNSW's efficiency and scalability make it ideal for large-scale vector data searches, significantly improving search performance in applications like image and document retrieval.
Text adapted from Wikipedia, licensed under CC BY-SA 4.0.
Related concepts
Star Trek III: The Search for Spock
How do we search for the best sequence in a sea of possibilities?
t-SNE preserves local structure
Can we see the hidden patterns in a cloud of data points?
UMAP is faster than t-SNE
UMAP is faster due to approximate nearest neighbors and cross-entropy optimization
Google data centers
How do massive online searches happen so fast?
MoE models have more parameters but similar compute cost
MoE models distribute parameters across k experts, reducing active experts' compute cost
Retrieval-augmented generation
RAG enables LLMs to access new information without retraining
Swipe through more Machine Learning concepts
Open Pocket Polymath