Factorized Hypothesis Search for Evidence-to-Taxonomy Retrieval

• URL: http://arxiv.org/abs/2608.06614v1
• Date: Thu, 06 Aug 2026 21:56:56 GMT
• Title: Factorized Hypothesis Search for Evidence-to-Taxonomy Retrieval
• Abstract summary: We show that the current index retrieves the target reliably when its semantics are explicit.<n>We propose Factorized Hypothesis Search (FHS), which maintains multiple partial interpretations over named semantic dimensions.<n>FHS achieves the best Recall@1, MRR, and final accuracy among the non-oracle methods.
• Score: 10.781394552172875
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• 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.

Related papers

• FinSAgent: Corpus-Aligned Multi-Agent RAG Framework for Evidence-Grounded SEC Filing Question Answering [16.415865984091667]
  FinSAgent is an evidence-grounded multi-agent framework that reframes SEC filing QA as corpus-aligned retrieval planning.<n>FinSAgent improves retrieval coverage and answer correctness over strong single-agent and multi-agent baselines.
  arXiv  Detail & Related papers  (2026-07-20T16:03:15Z)
• Before the Action: Benchmarking LLMs on Prospective Hypothesis Discovery [95.44432473367836]
  Large language models (LLMs) excel at answering pre-specified questions, yet their ability to navigate the open-ended, pre-conclusion stage of discovery remains largely unmeasured.<n>We introduce Prospective Hypothesis Discovery (PHD), which asks models to autonomously construct grounded, discnative, and testable hypothesis spaces from inconclusive evidence.<n>We introduce HypoArena, comprising HypoData, a benchmark of 988 cases across six scientific and analytical domains, and HypoEval, an evaluation framework for open-ended hypothesis sets.
  arXiv  Detail & Related papers  (2026-07-17T08:56:43Z)
• Hierarchical Evidence-Driven Reasoning for Long Document Understanding [95.51688464037096]
  We introduce HIEVI-RAG, a hierarchical, evidence-driven multimodal RAG framework for closed-domain document understanding.<n>Our framework significantly outperforms existing open-source baselines and exceeds the strongest reported baseline by an average of 8.05% in accuracy.
  arXiv  Detail & Related papers  (2026-07-06T03:08:28Z)
• R$^2$-Searcher: Calibrating Retrieval and Reasoning Boundaries for Agentic Search [59.034878430183305]
  R$2$-Searcher explicitly explores and calibrates the retrieval and reasoning boundaries.<n>We show that R$2$-Searcher significantly outperforms state-of-the-art agentic search methods in answer accuracy and retrieval-reasoning quality.
  arXiv  Detail & Related papers  (2026-06-26T19:44:34Z)
• Closing the Indexing-Decoding Gap in Multimodal Generative Retrieval via Prefix Retention Optimization [68.48718919047127]
  Multimodal generative retrieval formulates multimodal retrieval as discrete identifier generation, eliminating the need for explicit similarity search over external embeddings.<n>Existing approaches construct identifiers via residual quantization and decode them with trie-constrained beam search.<n>This combination introduces an indexing-decoding gap: identifier learning objectives, including reconstruction and contrastive losses, do not explicitly enforce prefix discriminability during decoding.<n>We propose PRO, a unified framework comprising three mechanisms: (i) prefix ranking distillation aligns quantized prefixes with those induced by pre-quantization embeddings using a listwise loss; (ii) vocabulary scheduling increases codebook
  arXiv  Detail & Related papers  (2026-06-08T09:15:47Z)
• Superintelligent Retrieval Agent: The Next Frontier of Information Retrieval [25.731213365755234]
  We introduce textitSuperIntelligent Retrieval Agent (SIRA)<n>SIRA can compress multi-round exploratory search into a single corpus-discriminative retrieval action.<n>It can exceed substantially more expensive multi-round search while remaining interpretable, training-free, and efficient.
  arXiv  Detail & Related papers  (2026-05-07T17:54:29Z)
• Beyond Semantic Similarity: Rethinking Retrieval for Agentic Search via Direct Corpus Interaction [127.64173950476702]
  We study direct corpus interaction (DCI), where an agent searches the raw corpus directly with general-purpose terminal tools.<n>This approach requires no offline indexing and adapts naturally to evolving local corpora.<n>Across IR benchmarks and end-to-end agentic search tasks, this simple setup substantially outperforms strong sparse, dense, and reranking baselines.
  arXiv  Detail & Related papers  (2026-05-03T19:13:11Z)
• Context-Aware Search and Retrieval Under Token Erasure [10.728269379368099]
  This paper introduces and analyzes a search and retrieval model for RAG-like systems under token erasures.<n>We provide an information-theoretic analysis of remote document retrieval when query representations are only partially preserved.
  arXiv  Detail & Related papers  (2026-04-20T15:42:12Z)
• Entropic Claim Resolution: Uncertainty-Driven Evidence Selection for RAG [0.0]
  We introduce Entropic Claim Resolution (ECR), a novel inference-time algorithm that reframes RAG reasoning as entropy minimization.<n>ECR selects atomic evidence claims by maximizing Expected Entropy Reduction (EER), a decision-theoretic criterion for the value of information.<n>Our framework provides a rigorous foundation for uncertainty-aware evidence selection, shifting the paradigm from retrieving what is most relevant to retrieving what is most discriminative.
  arXiv  Detail & Related papers  (2026-03-30T13:49:03Z)
• QUARK: Robust Retrieval under Non-Faithful Queries via Query-Anchored Aggregation [2.505352949111876]
  QUARK is a training-free framework for robust retrieval under non-faithful queries.<n>The design enables QUARK to improve recall and ranking quality without sacrificing robustness.
  arXiv  Detail & Related papers  (2026-01-28T21:14:49Z)
• GERE: Generative Evidence Retrieval for Fact Verification [57.78768817972026]
  We propose GERE, the first system that retrieves evidences in a generative fashion. The experimental results on the FEVER dataset show that GERE achieves significant improvements over the state-of-the-art baselines.
  arXiv  Detail & Related papers  (2022-04-12T03:49:35Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.