Pith. sign in

REVIEW 1 cited by

Few-Shot Data Synthesis for Open Domain Multi-Hop Question Answering

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 2305.13691 v2 pith:3KGF6T3H submitted 2023-05-23 cs.CL

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

Few-shot learning for open domain multi-hop question answering typically relies on the incontext learning capability of large language models (LLMs). While powerful, these LLMs usually contain tens or hundreds of billions of parameters, making them rather inefficient at inference time. To improve performance of smaller language models, we propose a data synthesis framework for multi-hop question answering that requires less than 10 human annotated question answer pairs. Our framework depends only on rich, naturally-occurring relationships among documents and is built upon the data generation functions parameterized by LLMs and prompts. We synthesize millions of multi-hop questions and claims to finetune language models, evaluated on popular benchmarks for multi-hop question answering and fact verification. Empirically, our approach improves model performance significantly, allowing the finetuned models to be competitive with GPT-3.5 based approaches while being almost one-third the size in parameter count.

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. Iterative Augmentation with Summarization Refinement (IASR) Evaluation for Unstructured Survey data Modeling and Analysis

    cs.CL 2025-07 reject novelty 5.0 of 10

    The paper evaluates four LLMs as text augmenters and reports GPT-3.5 Turbo as the best, and that combining augmentation with GPT topic labels increases BERTopic's discovered topics from 5 to 20 with zero overlap.

Pith tools