Efficiently perform Approximate Nearest Neighbor Search at Scale

This post is a summary of my notes trying to understand/explain SPANN’s algorithm, one of the latest and coolest advances in approximate nearest neighbor search. I even ended up coding a toy version myself! Thought It might interest somebody :D. I posted it in r/computersci but probably here it makes more sense. Hopefully somebody finds it interesting (even if it is not the most trendy topic like genAI). Feel free to give me thoughts about it.