Loading video...

Video Failed to Load

Go Home

209,353 views • 2 years ago •via X (Twitter)

10 Comments

Eugene Yan's profile picture
Eugene Yan2 years ago

bm25 & np.array is all you need

saint's profile picture
saint2 years ago

>increase the value of k real

darren's profile picture
darren2 years ago

hacked together database? you mean np.array

Grant♟️'s profile picture
Grant♟️2 years ago

based

vish's profile picture
vish2 years ago

those in arena, they know instead of similarity searching the query with chunks, do a similarity search of fictional answer to chunks

Rani's profile picture
Rani2 years ago

ty for the laugh (lots of truths in this) I'm still learning, but I think it starts from the design of your vector DB though. Rather than stuffing everything in one db and using scuffed queries, trying to make 2 and 2 equal 5... It's asking more fundamental questions: -What are you querying? -What do you want to get? -How does this VDB fit into the larger application? -How can you re-organize, reformat, re-index your data to minimize the complexity of the retrieval task: aka, making distinct chunks more dissimilar to each other? -How can you optimize your queries? -Do you need to split the db into several smaller db with more targeted data? -Do you need a re-ranking system? Get a first batch of data, re-rank using a different/more precise query. Probably more efficient than having a single query trying to find a needle in a haystack, and flipping a coin each time. Of course, keeping in mind time, number of operations, handling failure cases, etc...

Michael P. Frank 💻🔜♻️'s profile picture
Michael P. Frank 💻🔜♻️2 years ago

That’s pretty hilarious 😂 My Telegram bots work like this, but they’re just a hobby project, not a mission-critical enterprise application, so it’s not like it matters lol

Hamel Husain's profile picture
Hamel Husain2 years ago

This is amazing

json's profile picture
json2 years ago

Bloody banger man

Grant♟️'s profile picture
Grant♟️2 years ago

Lolll pretty much

Related Videos