Methods › Natural Language Processing › Table Question Answering Models › TAPAS
TAPAS
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
TAPAS is a weakly supervised question answering model that reasons over tables without generating logical forms. TAPAS predicts a minimal program by selecting a subset of the table cells and a possible aggregation operation to be executed on top of them. Consequently, TAPAS can learn operations from natural language, without the need to specify them in some formalism. This is implemented by extending BERT’s architecture with additional embeddings that capture tabular structure, and with two classification layers for selecting cells and predicting a corresponding aggregation operator.
In Syntology repository known, no verified implementation (declared_code; repositories: 5 listed of 12 in the graph, strongest link: official). The archive credits no paper with an arXiv id for this method, so whether this answer (about arXiv:2004.02349) is about this method is not checked.
Origin paper of this answer, arXiv:2004.02349 (its page on this site · its page on Syntology): Syntology's run record for its harvested code, 14 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified (of 14 harvested samples). The instrument figure counts failures of Syntology's instrument, not of the code. Ran means executed on a synthesized input, not that the code is correct.
Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.
Papers archive 2025-07-28
archive papers tagged: 10 · with a code link: 6 · where Syntology ran a sample: 2 (2 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (2 of 10 tagged: 2 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)
Page 1 of 1: papers 1 to 10 of 10, newest first by the archive's date (ties by slug), in archive order.
Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.
-
TAPAS: Thermal- and Power-Aware Scheduling for LLM Inference in Cloud Platforms 5 Jan 2025 · 0 repositories · arXiv:2501.02600
-
QATCH: Benchmarking SQL-centric tasks with Table Representation Learning Models on Your Data 26 Sep 2023 · 1 repository
-
Localize, Retrieve and Fuse: A Generalized Framework for Free-Form Question Answering over Tables 20 Sep 2023 · 0 repositories · arXiv:2309.11049
-
TAPAS: a Toolbox for Adversarial Privacy Auditing of Synthetic Data 12 Nov 2022 · 3 repositories · arXiv:2211.06550Syntology official (archive's flag): 6 ran · 6 ran (of which 1 constructed an object rather than computing a result; 5 with no instrument failure: 4 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified (of 11 harvested samples)
-
Table-To-Text generation and pre-training with TabT5 17 Oct 2022 · 0 repositories · arXiv:2210.09162
-
AttesTable at SemEval-2021 Task 9: Extending Statement Verification with Tables for Unknown Class, and Semantic Evidence Finding 1 Aug 2021 · 1 repository
-
Volta at SemEval-2021 Task 9: Statement Verification and Evidence Finding with Tables using TAPAS and Transfer Learning 1 Jun 2021 · 1 repository · arXiv:2106.00248
-
TAPAS at SemEval-2021 Task 9: Reasoning over tables with intermediate pre-training 2 Apr 2021 · 0 repositories · arXiv:2104.01099
-
Understanding tables with intermediate pre-training 1 Oct 2020 · 1 repository · arXiv:2010.00571
-
TAPAS: Weakly Supervised Table Parsing via Pre-training 5 Apr 2020 · 8 repositories · arXiv:2004.02349Syntology community repositories only · 14 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified (of 14 harvested samples)
Tasks archive 2025-07-28
20 shown of 22 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.
Usage over time archive 2025-07-28
Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).
Categories archive 2025-07-28
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections