No AI summary available for this article.
Why It Matters
Multi-hop retrieval failures are not uniformly distributed across queries: they cluster in structurally predictable subpopulations.
Provenance
Discovered via ArXiv and published by ArXiv.
Key Claims
Original description
Multi-hop retrieval failures are not uniformly distributed across queries: they cluster in structurally predictable subpopulations. We prove two results formalizing this structure. First (CWAR Reducibility): confident-failure reduction is achievable if and only if retrieval features carry mutual information about success, a condition satisfied by LLM-judge pipelines but substantially weaker in dense-only settings, explaining the AUC-AC gap between regimes. Second (Feature Regime Complementarity): no single ANN score feature achieves best predictive performance across all failure regimes; the d...
Discovered via ArXiv
Research papers and preprints from arXiv.
Publisher: arxiv.org
ID: http://arxiv.org/abs/2609.22056v1 · Indexed about 4 hours ago