REVIEW 9 cited by
Answering Complex Open-Domain Questions with Multi-Hop Dense Retrieval
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
We propose a simple and efficient multi-hop dense retrieval approach for answering complex open-domain questions, which achieves state-of-the-art performance on two multi-hop datasets, HotpotQA and multi-evidence FEVER. Contrary to previous work, our method does not require access to any corpus-specific information, such as inter-document hyperlinks or human-annotated entity markers, and can be applied to any unstructured text corpus. Our system also yields a much better efficiency-accuracy trade-off, matching the best published accuracy on HotpotQA while being 10 times faster at inference time.
Forward citations
Cited by 9 Pith papers
-
MINTQA: A Multi-Hop Question Answering Benchmark for Evaluating LLMs on New and Tail Knowledge
MINTQA provides 28,366 multi-hop QA pairs across popular/unpopular and old/new knowledge, with sub-questions, and shows that even the best LLMs achieve only about 62% accuracy even with retrieval.
-
Retrieving a Set, Not Independent Passages: Set-Level Compatibility Learning for Efficient Set Exploration
Set-level margin training that ranks complete gold-compatible passage sets above incomplete or noisy ones, implemented with ParaSet exploration and SetCE reranking, improves multi-hop retrieval and QA and complements ...
-
Context is Gold to find the Gold Passage: Evaluating and Training Contextual Document Embeddings
A new benchmark (ConTEB) and training method (InSeNT) show that context-aware chunk embeddings greatly improve retrieval on context-dependent queries, with minimal computational overhead.
-
HyCE-RAG: Hypergraph Chain-of-Evidence Retrieval-Augmented Generation for Explainable Multi-hop Question Answering
Organizing retrieved evidence into confidence-scored hypergraph chains is reported to lift multi-hop QA accuracy, context relevance, and faithfulness by 11–30 points over vector and graph RAG baselines on five benchmarks.
-
DeepResearch-9K: A Challenging Benchmark Dataset of Deep-Research Agent
A synthetic benchmark of 9,000 multi-hop web-research questions with difficulty tiers and teacher-generated search trajectories, plus an open-source RL training framework that reportedly lets 3B-parameter agents beat ...
-
ComposeRAG: A Modular and Composable RAG for Corpus-Grounded Multi-Hop Question Answering
A modular, verifier-driven RAG pipeline with iterative re-decomposition outperforms fine-tuned and agentic baselines on four multi-hop QA benchmarks.
-
Tree-Based Text Retrieval via Hierarchical Clustering in RAGFrameworks: Application on Taiwanese Regulations
A hierarchical clustering tree with cosine-similarity centroids can replace top-k retrieval in RAG and improve expert-rated legal answers without tuning k.
-
Fact in Fragments: Deconstructing Complex Claims via LLM-based Atomic Fact Extraction and Verification
AFEV iteratively decomposes complex claims into atomic facts, verifies each with reranked evidence and dynamic demonstrations, and reports state-of-the-art results on five fact verification benchmarks.
-
Enhancing Factual Accuracy and Citation Generation in LLMs via Multi-Stage Self-Verification
The paper proposes a four-stage self-verification prompting method but explicitly labels its experimental results as fabricated, so it cannot support its claimed gains.
Discussion (0). Continue with ORCID to comment.