Exact Binary Vector Search for RAG in 100 Lines of Julia

Re:Exact Binary Vector Search for RAG in 100 Lines of Julia by floobertoober on Friday May 17, 2024 @06:33PM (#40394766)

I'm not sure what is meant by "exact" here - do they describe their binarisation process at all? This seems more like an XOR benchmark than a rag benchmark, no mention of recall or other relevant performance metrics

[ Parent | on HN ]

Re:Exact Binary Vector Search for RAG in 100 Lines of Julia by jjnoakes on Friday May 17, 2024 @06:57PM (#40394933)

Some (not all) of your questions may be answered by the linked article near the top of the submitted article, which goes into more detail about how much is lost quantizing to 1 bit (and 1 byte): https://huggingface.co/blog/embedding-quantization

[ Parent | on HN ]

Re:Exact Binary Vector Search for RAG in 100 Lines of Julia by lunaticd on Friday May 17, 2024 @08:09PM (#40395387)

exact in this case means that all the vectors are compared against the query vector. Where as other search methods such as HNSW are approximate searches.

[ Parent | on HN ]