Pith. sign in

REVIEW 2 cited by

CARTE: Pretraining and Transfer for Tabular Learning

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 2402.16785 v2 pith:3YOMG66B submitted 2024-02-26 cs.LG

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

Pretrained deep-learning models are the go-to solution for images or text. However, for tabular data the standard is still to train tree-based models. Indeed, transfer learning on tables hits the challenge of data integration: finding correspondences, correspondences in the entries (entity matching) where different words may denote the same entity, correspondences across columns (schema matching), which may come in different orders, names... We propose a neural architecture that does not need such correspondences. As a result, we can pretrain it on background data that has not been matched. The architecture -- CARTE for Context Aware Representation of Table Entries -- uses a graph representation of tabular (or relational) data to process tables with different columns, string embedding of entries and columns names to model an open vocabulary, and a graph-attentional network to contextualize entries with column names and neighboring entries. An extensive benchmark shows that CARTE facilitates learning, outperforming a solid set of baselines including the best tree-based models. CARTE also enables joint learning across tables with unmatched columns, enhancing a small table with bigger ones. CARTE opens the door to large pretrained models for tabular data.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. NGDBench: Towards Neural Graph Data Management

    cs.DB 2026-02 conditional novelty 6.0 of 10

    NGDBench is a five-domain noisy-graph benchmark showing current LLM query methods fail on aggregation and state tracking under data perturbation.

  2. Towards Benchmarking Foundation Models for Tabular Data With Text

    cs.LG 2025-07 conditional novelty 5.0 of 10

    A new 13-dataset benchmark shows that adding text embeddings to tabular models usually improves accuracy, but no embedding or downsampling strategy dominates.

Pith tools