Papers › CARTE: Pretraining and Transfer for Tabular Learning

CARTE: Pretraining and Transfer for Tabular Learning

26 Feb 2024arXiv:2402.16785archive 2025-07-28

Myung Jun Kim, Léo Grinsztajn, Gaël Varoquaux

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.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2402.16785")

Code

Syntology Ran 5 of 6 code samples harvested from 1 repository linked to this paper; 1 has no recorded run. Of those that ran: 5 ran with no contract checked.

By repository: official repository: 6 samples from 1 repository, 5 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

soda-inria/carte officialmentioned in papermentioned on GitHubpytorchBSD-3-Clause report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

6 samples harvested; 5 ran; 0 honoured the contract we drafted; 1 has no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

5ran
1unverified

Licence: 0 of the 6 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from soda-inria/carte. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

carte_gridsearch soda-inria/carte/carte_ai/src/carte_gridsearch.py official repository ran BSD-3-Clause (permissive) · 4b924c5969fa9958 · report
generate_df_cdd soda-inria/carte/carte_ai/src/visualization_utils.py official repository ran BSD-3-Clause (permissive) · d5b96afdb72d8b1e · report
set_score_criterion soda-inria/carte/carte_ai/src/evaluate_utils.py official repository ran fingerprinted BSD-3-Clause (permissive) · b3d047e62b963310 · report
set_split soda-inria/carte/carte_ai/src/evaluate_utils.py official repository ran BSD-3-Clause (permissive) · eaa00d5714148e18 · report
sign_array soda-inria/carte/carte_ai/src/visualization_utils.py official repository ran fingerprinted BSD-3-Clause (permissive) · 3eb9de7b9abcc25a · report
extract_llm_features soda-inria/carte/carte_ai/src/preprocess_utils.py official repository unverified BSD-3-Clause (permissive) · 7e99a09bb11ae525 · report

Tasks

Data IntegrationTransfer Learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

AWARESET

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