We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. We have no repository linked to it either. That is a statement about our graph, not about the paper.
Existing approaches for open-domain question answering (QA) are typically designed for questions that require either single-hop or multi-hop reasoning, which make strong assumptions of the complexity of questions to be answered. Also, multi-step document retrieval often incurs higher number of relevant but non-supporting documents, which dampens the downstream noise-sensitive reader module for answer extraction. To address these challenges, we propose a unified QA framework to answer any-hop open-domain questions, which iteratively retrieves, reranks and filters documents, and adaptively determines when to stop the retrieval process. To improve the retrieval accuracy, we propose a graph-based reranking model that perform multi-document interaction as the core of our iterative reranking framework. Our method consistently achieves performance comparable to or better than the state-of-the-art on both single-hop and multi-hop open-domain QA datasets, including Natural Questions Open, SQuAD Open, and HotpotQA.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2009.07465")
get_code_for_paper("2009.07465")
have("2009.07465")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2009.07465.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2009.07465)
Connect an agent — have() is free.