CoChat

Large Language Models are few(1)-shot Table Reasoners

Open access
Chen, Wenhu · 2023 · Findings of the Association for Computational Linguistics: EACL 2023
Cited by 97

The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.

Abstract

Recent literature has shown that large language models (LLMs) are generally excellent fewshot reasoners to solve text reasoning tasks.However, the capability of LLMs on table reasoning tasks is yet to be explored.In this paper, we aim at understanding how well LLMs can perform table-related tasks with few-shot in-context learning.Specifically, we evaluated LLMs on popular table QA and fact verification datasets like WikiTableQuestion, Fe-taQA, TabFact, and FEVEROUS and found that LLMs are competent at complex reasoning over table structures, though these models are not pre-trained on any table corpus.When combined with 'chain of thoughts' prompting, LLMs can achieve very strong performance with only a 1-shot demonstration, even on par with some SoTA models.We show that LLMs are even more competent at generating comprehensive long-form answers on FetaQA than tuned T5-large.We further manually studied the reasoning chains elicited from LLMs and found that these reasoning chains are highly consistent with the underlying semantic form.We believe that LLMs can serve as a simple yet generic baseline for future research.The code and data are released in https://github. com/wenhuchen/TableCoT.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.18653/v1/2023.findings-eacl.83

Cites

22 of 22 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Cited by

See all 97

Metadata

Authors
Chen, W.
Venue
Findings of the Association for Computational Linguistics: EACL 2023
Published
2023
Pages
1120-1130
OpenAlex
W4386566488
Cited by
97
References
22
FWCI
18.34
Type
conference paper
Language
en
Open access
hybrid

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.