This work proposes Factorized Hypothesis Search (FHS), which maintains multiple partial interpretations over named semantic dimensions that support structured query rendering, multi-hypothesis retrieval, and dimension-level candidate verification.
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.
STAR is presented, a structure-aware adaptive retrieval framework for RAG that treats this mismatch as a problem of diagnosing evidence sufficiency and benefits from a control signal that preserves structurally distinct insufficiency patterns rather than collapsing them into a single scalar confidence estimate.
Retrieval diversification is widely available in retrieval-augmented generation (RAG) frameworks, yet prior studies disagree on whether it improves retrieval and answer quality. We show that its effectiveness varies primarily with candidate-pool redundancy, in a pattern consistent with the number of distinct evidence p...
Guillaume Brouillette, Faustin Kagabo, Usef Faghihi et al.· 0 citations
High-precision retrieval over external knowledge bases is essential for LLM agents to operate effectively. However, existing Information Retrieval (IR) research primarily optimizes query-side retrievers (e.g., ColBERT, BGE) and generators (e.g., Self-RAG, GraphRAG), while reducing corpus-side representation to chunking...
seek, Self-Evaluative Exploration for Knowledge Retrieval, a training-free framework that addresses this limitation through iterative corpus interaction at test time through iterative corpus interaction at test time.
Bag-of-Documents Specificity (BoDS) is introduced, a two-stage approach that operationalizes query specificity as intent coherence : how tightly a query’s engaged documents cluster in embedding space using the mean resultant length of a query’s associated document vectors.
Aritra Mandal, Daniel Tunkelang, Zhe Wu· 0 citations
Budgeted Flat Reconstruction (BFR), which builds sufficient sets over a fixed flat memory store in two stages, and outperforms same-store adaptations of recent agent-memory systems in both answer quality and evidence coverage.
Yufeng Li, Shu-Xin Li, Zhenhua Xu et al.· 1 citation
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.