Skip to content

Commit

Permalink
Update Blog “binary-quantization-andrey-vasnetsov-vector-space-talk-001”
Browse files Browse the repository at this point in the history
  • Loading branch information
demetrios committed Jan 9, 2024
1 parent d2b18a3 commit ca0b73d
Showing 1 changed file with 5 additions and 5 deletions.
Original file line number Diff line number Diff line change
Expand Up @@ -17,7 +17,7 @@ tags:
- Qdrant
---

> "Everything changed when we actually tried binary quantization with OpenAI model.”\
> *"Everything changed when we actually tried binary quantization with OpenAI model.”*\
> -- Andrey Vasnetsov
Ever wonder why we need quantization for vector indexes? Andrey Vasnetsov explains the complexities and challenges of searching through proximity graphs. Binary quantization reduces storage size and boosts speed by 30x, but not all models are compatible.
Expand All @@ -44,7 +44,7 @@ In this episode, Andrey shares invaluable insights into the world of binary quan
4. Understanding the simplicity and effectiveness of binary quantization, especially when compared to more intricate quantization methods.
5. The ongoing research and potential impact of binary quantization on future models.

> *Fun Fact: Binary quantization can deliver processing speeds over 30 times faster than traditional quantization methods, which is a revolutionary advancement in vector space technology.*
> Fun Fact: Binary quantization can deliver processing speeds over 30 times faster than traditional quantization methods, which is a revolutionary advancement in vector space technology.
>
## Show Notes:
Expand All @@ -58,13 +58,13 @@ In this episode, Andrey shares invaluable insights into the world of binary quan

## More Quotes from Andrey:

"Inside Qdrant we use HNSW vector Index, which is essentially a proximity graph. You can imagine it as a number of vertices where each vertex is representing one vector and links between those vertices representing nearest neighbors.”\
*"Inside Qdrant we use HNSW vector Index, which is essentially a proximity graph. You can imagine it as a number of vertices where each vertex is representing one vector and links between those vertices representing nearest neighbors.”*\
-- Andrey Vasnetsov

"The main idea is that we convert the float point elements of the vector into binary representation. So, it's either zero or one, depending if the original element is positive or negative.”\
*"The main idea is that we convert the float point elements of the vector into binary representation. So, it's either zero or one, depending if the original element is positive or negative.”*\
-- Andrey Vasnetsov

"We tried most popular open source models, and unfortunately they are not as good compatible with binary quantization as OpenAI.”\
*"We tried most popular open source models, and unfortunately they are not as good compatible with binary quantization as OpenAI.”*\
-- Andrey Vasnetsov

## Transcript:

0 comments on commit ca0b73d

Please sign in to comment.