arXiv (OAI Expanded)
open access
Top-K Is Not a Budget for Hybrid Retrieval
Modern hybrid retrieval for RAG typically fuses the Top-$L$ results from dense and sparse retrievers, but a fixed truncation depth may not transfer across changing queries and corpora. Exact fusion removes the dependence on a fixed depth, yet completing a specified Top-$K$ still incurs variable acce
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
- Descent Tops and Pinnacles on 2143- and 3421-Avoiding Permutations#1156012
- Decentralized Machine Learning with Centralized Performance Guarantees via Gibbs Algorithms#142680
- Decentralized Machine Learning with Centralized Performance Guarantees via Gibbs Algorithms#124075
- Finding all sorting tandem duplication random loss operations#622711
- Efficient estimation and the cost of complete-case coarsening under monotone sequential MAR#1011499
Record · ID 1109196
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