179 questions
No questions match those filters.
← All questions
Retrieval & EmbeddingsMedium· HNSW· Data Structures· Algorithms
How do you derive HNSW from a skip list, and how many l...
This is one of the questions in the full AI/ML interview bank. Pro unlocks all 1789 questions; Premium includes the same bank plus the highest daily Practice limit.
See plansThe derivation requires shifting from a linear ordering to a graph-based structure. The height of the graph is determined by the probability distribution of node promotion (Pr[ℓ ≥ j] = M^-j). With M=16, the structure results in six layers, with the top layer being sparse, allowing for efficient navigation toward the target.