$\mathbb{R}^{2k}$ is Theoretically Large Enough for Embedding-based Top-$k$ Retrieval

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Wang, Zihao, Yin, Hang, Liu, Lihui, Tong, Hanghang, Song, Yangqiu, Wong, Ginny, See, Simon
Format:	Preprint
Published:	2026
Subjects:	Machine Learning Artificial Intelligence Information Retrieval
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Internet

https://arxiv.org/abs/2601.20844