arXiv (All)
open access
Learning Query Encoders Can Be Hard Even When Vector Retrieval Is Geometrically Easy
Efficient vector retrieval requires both a corpus geometry that supports retrieving the right documents through vector similarity, and a query encoder that can embed queries near their desired documents in the embedding space. Recent work has studied geometric capacity through the lens of the minimu
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Recall Before Rerank: Benchmarking Deep Learning Models for Large-Scale Code-to-Code Retrieval#319742
- Neuro-Relational Programs: Unifying Queries and Neural Computation over Structured Data#1357190
- Inject, Align, Recover: Staged Post-Training for Retrieval-Free Document Knowledge Internalization#471272
- CVE-2026-104751 — MEDIUM 5.3#1359632
- Adaptive memory: The effects of survival-constrained retrieval on recognition depend on initial encoding conditions / Raoul Bell, Laura Mieth, Meike Kroneisen#1214960
Record · ID 1187063
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive