Pith. sign in

REVIEW 1 cited by

Learning to Recover Reasoning Chains for Multi-Hop Question Answering via Cooperative Games

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

arxiv 2004.02393 v1 pith:ZTTHKDHO submitted 2020-04-06 cs.CL

classification cs.CL
keywords chainsreasoningapproachcooperativelearningmulti-hoppassagesproblem
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

We propose the new problem of learning to recover reasoning chains from weakly supervised signals, i.e., the question-answer pairs. We propose a cooperative game approach to deal with this problem, in which how the evidence passages are selected and how the selected passages are connected are handled by two models that cooperate to select the most confident chains from a large set of candidates (from distant supervision). For evaluation, we created benchmarks based on two multi-hop QA datasets, HotpotQA and MedHop; and hand-labeled reasoning chains for the latter. The experimental results demonstrate the effectiveness of our proposed approach.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. MINTQA: A Multi-Hop Question Answering Benchmark for Evaluating LLMs on New and Tail Knowledge

    cs.CL 2024-12 conditional novelty 7.0 of 10

    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.

Pith tools