No article text was recorded for this version.
vector space collision probability
Version 1 of 16 papers17 conceptsfrozen 2026-10-04
Papers in this version
- Blog: On the Theoretical Limitations of Embedding-Based Retrieval
- Blog: The Curse of Dense Low-Dimensional Information Retrieval for Large Index Sizes
- Blog: $\mathbb{R}^{2k}$ is Theoretically Large Enough for Embedding-based Top-$k$ Retrieval
- Blog: LitSearch: A Retrieval Benchmark for Scientific Literature Search
- Blog: $\mathbb{R}^{2k}$ is Theoretically Large Enough for Embedding-based Top-$k$ Retrieval
- Blog: The space complexity of inner product filters
History & citation
Current · Permanent link
- This direction split from The Geometric Ceiling of Single Vector Retrieval (50% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_vector_space_collision_probability_daeac819,
title = {vector space collision probability},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/vector-space-collision-probability/rdr_daeac819b9ed4092882732a44ec6e057},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_vector_space_collision_probability_daeac819_v1,
title = {vector space collision probability},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/vector-space-collision-probability/rdr_daeac819b9ed4092882732a44ec6e057/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}