aiqbench analysis
This paper addresses the "retrieval readiness gap" in large-taxonomy systems by introducing Factorized Hypothesis Search (FHS), which maintains multiple partial interpretations across semantic dimensions to handle indirect evidence like table cells. Experimental results on financial tagging and clinical coding tasks demonstrate that FHS significantly outperforms standard free-text ensembles in Recall@1 and MRR, establishing a new baseline for handling context-dependent inputs.
Factorized Hypothesis Search for Evidence-to-Taxonomy Retrieval
arXiv:2608.06614v2 Announce Type: replace-cross Abstract: Large-taxonomy retrieval often assumes that the input already expresses the target concept. In many settings, however, the input is indirect evidence, such as a table cell whose meaning depends on its row, column, datatype, and context. We call this mismatch the retrieval readiness gap. Our analysis shows that the current index retrieves the target reliably when its semantics are explicit, while raw evidence often leaves it deep in the ranking. We propose Factorized Hypothesis Search (FHS), which maintains multiple partial interpretations over named semantic dimensions. These hypotheses support structured query rendering, multi-hypothesis retrieval, and dimension-level candidate verification. On both financial taxonomy tagging and CodiEsp clinical coding tasks, FHS achieves the best Recall@1, MRR, and final accuracy among the non-oracle methods. Replacing the factorized hypothesis path with a free-text ensemble causes the largest drop in head-ranking performance, while sequential refinement provides no additional gain over FHS's strong parallel first round.
Abstract:Large-taxonomy retrieval often assumes that the input already expresses the target concept. In many settings, however, the input is indirect evidence, such as a table cell whose meaning depends on its row, column, datatype, and context. We call this mismatch the retrieval readiness gap. Our analysis shows that the current index retrieves the target reliably when its semantics are explicit, while raw evidence often leaves it deep in the ranking. We propose Factorized Hypothesis Search (FHS), which maintains multiple partial interpretations over named semantic dimensions. These hypotheses support structured query rendering, multi-hypothesis retrieval, and dimension-level candidate verification. On both financial taxonomy tagging and CodiEsp clinical coding tasks, FHS achieves the best Recall@1, MRR, and final accuracy among the non-oracle methods. Replacing the factorized hypothesis path with a free-text ensemble causes the largest drop in head-ranking performance, while sequential refinement provides no additional gain over FHS's strong parallel first round.
Computation and Language (cs.CL); Artificial Intelligence (cs.AI)
arXiv:2608.06614 [cs.CL]
(or arXiv:2608.06614v2 [cs.CL] for this version)
https://doi.org/10.48550/arXiv.2608.06614 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 245 words
Related coverage
Trustworthy Domain-Specific AI for Structured Knowledge Retrieval and Reasoning
arXiv · Oct 8, 2026

The standard for agents you can trust: Lessons from the federal front lines
Snorkel AI Blog · Jun 5, 2026

PIRAMID: Progress and Plans
LessWrong · Jul 27, 2026

[AINews] Opus 5.5 is good at explainer videos
Latent Space · Sep 29, 2026