Pith. sign in

REVIEW 3 cited by

TABBIE: Pretrained Representations of Tabular Data

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 2105.02584 v1 pith:JONORRBM submitted 2021-05-06 cs.CL

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

Existing work on tabular representation learning jointly models tables and associated text using self-supervised objective functions derived from pretrained language models such as BERT. While this joint pretraining improves tasks involving paired tables and text (e.g., answering questions about tables), we show that it underperforms on tasks that operate over tables without any associated text (e.g., populating missing cells). We devise a simple pretraining objective (corrupt cell detection) that learns exclusively from tabular data and reaches the state-of-the-art on a suite of table based prediction tasks. Unlike competing approaches, our model (TABBIE) provides embeddings of all table substructures (cells, rows, and columns), and it also requires far less compute to train. A qualitative analysis of our model's learned cell, column, and row representations shows that it understands complex table semantics and numerical trends.

Discussion (0). Sign in to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Generative Optimization for Incentivized Advertising with Global Level Constraints

    cs.LG 2026-08 conditional novelty 5.0 of 10

    Tokenized autoregressive generation of incentive amounts with a lambda-conditioned policy and constraint-aware alignment (SCPO) reports higher revenue, higher ROI, and fewer ROI violations than six baselines on one in...

  2. No Universal Prompt: Unifying Reasoning through Adaptive Prompting for Temporal Table Reasoning

    cs.CL 2025-06 reject novelty 5.0 of 10

    An adaptive prompting framework called SEAR is claimed to beat fixed prompting strategies across temporal table QA datasets, but reported scores contradict the headline and rely on an unvalidated metric.

  3. LLM-Symbolic Integration for Robust Temporal Tabular Reasoning

    cs.CL 2025-06 conditional novelty 4.0 of 10

    Schema-based SQL generation makes LLM temporal table QA more robust to counterfactual data and large tables than direct prompting, on a new synthetic benchmark.

Pith tools