Another impressive paper by Google DeepMind. It takes a closer look...

This paper looks at how search engines that rely on vector embeddings have built-in limits.
Even if you train them perfectly, they just can’t handle every possible search query once the combinations of relevant documents get too complex.
The authors prove this with math, then confirm it with experiments on a simple but tricky dataset they call LIMIT.
The authors built a toy dataset where queries are super simple. LIMIT maps all 2-document combinations to natural-language queries like “Who likes X?”
Despite this, top embedding models collapse, scoring below 20% recall when the task forces them to juggle all possible two-document combinations.
A smaller 46-document version is still unsolved at recall@20.
In conclusion, single-vector embeddings are powerful, but fundamentally limited.
If your searches require mixing and matching lots of concepts (as instruction-following queries often do), you’ll eventually hit a wall no matter how much data or training you throw at them.
Paper: arxiv.org/abs/2508.21038






