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

Documenti analoghi

• Logic Query of Thoughts: Guiding Large Language Models to Answer Complex Logic Queries with Knowledge Graphs
  di: Liu, Lihui, et al.
  Pubblicazione: (2024)
• RecRanker: Instruction Tuning Large Language Model as Ranker for Top-k Recommendation
  di: Luo, Sichun, et al.
  Pubblicazione: (2023)
• Efficient Long-Document Reranking via Block-Level Embeddings and Top-k Interaction Refinement
  di: Li, Minghan, et al.
  Pubblicazione: (2025)
• Unbiased Top-k Learning to Rank with Causal Likelihood Decomposition
  di: Zhao, Haiyuan, et al.
  Pubblicazione: (2022)
• Efficient Top-k s-Biplexes Search over Large Bipartite Graphs
  di: Xu, Zhenxiang, et al.
  Pubblicazione: (2024)