Name: MLn Club (ML Reading Group) #11: Fundamental Limitations of Single-Vector Embeddings
Start: 2026-07-27T19:00:00.000-04:00
End: 2026-07-27T21:00:00.000-04:00
Location: Pittsburgh, PA

We meet weekly on Sundays in person to talk about ML papers! Optional quiet reading from 7 pm, discussion starts 8 pm. Come and join the discussion! Open to all. Website: https://czhs.github.io/mln/

MLn Reading Club

Fundamental Limitations of Single-Vector Embeddings

On the Theoretical Limitations of Embedding-Based Retrieval

Why does something as simple as "finding people who like apples" break our best models?

What do alternatives like multi-vector models or cross-encoders mean for real products?

This research establishes a fundamental mathematical constraint in dense retrieval: embedding models cannot represent all possible top-k combinations of relevant documents simultaneously.

Weller et al. demonstrate this through both theory and a clever benchmark (LIMIT) where even advanced state-of-the-art models struggle with trivially simple queries, suggesting important implications for instruction-following retrieval systems.

 for discussion at 8 pm, and (optional) quiet reading from 7 pm.

📖 Reading Recommendations, Questions, or Comments? Contact us 

People who've been wanting to read up on the latest papers in ML and other fields but just haven't been able to find the time/motivation.