Bits-over-Random (BoR) is a chance-corrected metric for tool shortlist evaluation that enables query-adaptive depth selection via RL, matching fixed-list coverage with shorter lists on BFCL and ToolBench.
Cluster-based Adaptive Retrieval: Dynamic Context Selection for
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.IR 2years
2026 2verdicts
UNVERDICTED 2representative citing papers
Co-occurrence-aware KB clustering raises session-level RAG coverage from 41% to 58% on WixQA while cutting retrieval calls and compressing the KB to 20% of original size.
citing papers explorer
-
How Many Tools Should an LLM Agent See? A Chance-Corrected Answer
Bits-over-Random (BoR) is a chance-corrected metric for tool shortlist evaluation that enables query-adaptive depth selection via RL, matching fixed-list coverage with shorter lists on BFCL and ToolBench.
-
One Retrieval to Cover Them All: Co-occurrence-Aware Knowledge Base Reorganization for Session-Level RAG
Co-occurrence-aware KB clustering raises session-level RAG coverage from 41% to 58% on WixQA while cutting retrieval calls and compressing the KB to 20% of original size.