mlsanityData to 14 Oct 2026

Is It Still Worth Training a Classical Model in the Era of LLMs? A Crossover Benchmark on Tabular Data

arXiv 2609.20218 ↗First posted 28 Jul 2026cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Large language models can label a tabular row from a plain-English description with no training - a capability now shipping in mainstream spreadsheet tools such as Microsoft Copilot in Excel and Anthropic's Claude for Excel - raising a practical question for the many business prediction problems where labels are expensive: should you prompt a frozen LLM, or collect data and train a model - and if so, how much data? We quantify the answer with the labeled-data crossover N*, the training-set size at which a trained classical model's learning curve overtakes a frozen LLM's training-free (and therefore flat) error. Aggregating 126 independent student evaluations of small GPT models under eight prompting configurations across 18 tabular datasets, paired with authoritative power-law learning curves for six classical model families, we find that training wins fast: even given an oracle choice of its best prompt configuration, a trained classical model beats the small frozen LLM using no more labeled data than is already on hand in 86% of cases, and wins by the smallest labeled subset we evaluate in 40%, with the observed crossover at a median of ~6% of the training set. In-context few-shot examples do not behave like training - error versus shot count does not follow a power law - and the same protocol re-run by independent implementers varies with a coefficient of variation of 0.148. A controlled probe indicates the LLM depends on recognizable feature-name semantics, which plausibly makes our crossover a conservative estimate (we do not claim memorization). For a typical business table, the evidence is clear: collect a few hundred labels and train a gradient-boosted model.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 15 of its 28 references that are in the map. First posted on arXiv 28 Jul 2026.

Builds on

15 of 28 references.

References · 15

  1. 2020Scaling Laws for Neural Language Modelscited by 6,586
  2. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,166
  3. 2020Extracting Training Data from Large Language Modelscited by 2,189
  4. 2021Revisiting Deep Learning Models for Tabular Datacited by 740
  5. 2022TabPFN: A Transformer That Solves Small Tabular Classification Problems in a Secondcited by 674
  6. 2019TabNet: Attentive Interpretable Tabular Learningcited by 648
  7. 2017Deep Learning Scaling is Predictable, Empiricallycited by 582
  8. 2021Deep Neural Networks and Tabular Data: A Surveycited by 491
  9. 2020AutoGluon-Tabular: Robust and Accurate AutoML for Structured Datacited by 383
  10. 2022Data Contamination: From Memorization to Exploitationcited by 236
  11. 2023When Do Neural Nets Outperform Boosted Trees on Tabular Data?cited by 223
  12. 2019Neural Oblivious Decision Ensembles for Deep Learning on Tabular Datacited by 203
3 more
  1. 2021Well-tuned Simple Nets Excel on Tabular Datasetscited by 151
  2. 2022LIFT: Language-Interfaced Fine-Tuning for Non-Language Machine Learning Taskscited by 148
  3. 2024Large Scale Transfer Learning for Tabular Data via Language Modelingcited by 76

Built on by

Not cited yet.