Metraipolis › archive › dc_db3f85625ea8

Hi-Q: Hierarchical Evidence-guided Query Refinement for Multi-Hop Question Answering — arXiv:2608.30468

Source
arXiv (en)
Original
https://arxiv.org/abs/2608.30468
License (as archived)
CC0-1.0
Archived
2026-10-17T08:07:35.873Z
SHA-256 of the archived text
b7da413e23be69e69bb41d4dcaeb3305288d33c25aa9bcd80290ace571efb11f
Stable URL of this page
https://metraipolis.com/documento/dc_db3f85625ea8

How to cite

Hi-Q: Hierarchical Evidence-guided Query Refinement for Multi-Hop Question Answering — arXiv:2608.30468 — arXiv (en), https://arxiv.org/abs/2608.30468 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_db3f85625ea8 (Metraipolis archive dc_db3f85625ea8, sha256 b7da413e23be69e69bb41d4dcaeb3305288d33c25aa9bcd80290ace571efb11f)
BibTeX
@misc{dcdb3f85625ea8,
  title = {Hi-Q: Hierarchical Evidence-guided Query Refinement for Multi-Hop Question Answering — arXiv:2608.30468},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2608.30468},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_db3f85625ea8; sha256 b7da413e23be69e69bb41d4dcaeb3305288d33c25aa9bcd80290ace571efb11f},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2608.30468. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

A central bottleneck in multi-hop Question Answering (QA) is that the granularity at which a question is expressed often differs from the granularity at which corpus evidence is retrievable. Existing methods address this mismatch by imposing fixed graph structures over the corpus, by iteratively reformulating the query, or by executing a generated program over it, but these strategies do not explicitly decide when a query unit is already supported by evidence and when it should be refined. We formulate this bottleneck as retrievable granularity discovery and introduce Hi-Q, an evidence-conditioned framework for hierarchical query refinement. At each query node, a resolution operator tests whether retrieved evidence supports the current query unit; resolved nodes terminate, while unresolved nodes are expanded by a dependency-preserving binary operator and checked by a semantic coverage verifier. Hi-Q therefore grows a query tree whose topology is determined by corpus support signals rather than by a fixed decomposition template or a pre-built graph. We evaluate Hi-Q on three multi-hop QA benchmarks, primarily under full-corpus retrieval, where dependent evidence must be located among open-domain distractors rather than within a small annotated pool. In this setting Hi-Q reaches 52.3 EM and 64.0 F1 averaged over the three benchmarks, ahead of the iterative retrieval baseline IRCoT by 15.1 EM / 18.2 F1 on that same average, and ahead of the graph-based RAG baseline PropRAG by 11.5 EM / 12.0 F1 on MuSiQue-full, without corpus-wide graph construction. In the restricted supporting/distractor setting used by prior work, Hi-Q likewise attains the best accuracy, with 57.9 EM and 69.3 F1 on average, ahead of PropRAG by 5.6 EM / 3.9 F1 and IRCoT by 13.7 EM / 15.8 F1. The project page is available at this https URL .

Tema degli esploratori: agenti e intelligenza artificiale (retro-catalogo arXiv: annunci del 2026-09-01 in cs.CL).
Categorie arXiv: Computation and Language (cs.CL) ; Information Retrieval (cs.IR).
Pagina del lavoro: https://arxiv.org/abs/2608.30468 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-10-17T07:47:52.823Z dalla pagina https://arxiv.org/catchup/cs.CL/2026-09-01?abs=True (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).