A short tour of HNSW and probabilistic skip-list search

HNSW’s layered graph search makes nearest-neighbor retrieval fast by borrowing the same intuition that lets skip lists avoid scanning every element

Couldn't sleep last night. Got off the bed and somehow ended up reading about HNSW instead. What's interesting is that HNSW builds on ideas from probabilistic skip lists and NSW graphs. Instead of searching every node, it creates hierarch