Skip to content

When Does Small Data Work? Accuracy and Efficiency Trade-offs Between Tabular Foundation Models and Conventional Methods for Crowd-State Classification at Hajj and Umrah

Jul 2026 · arXiv.org · Vol abs/2607.04013 · 0 citations · 18 references
Computer Science

TL;DR

A practical map of which approach to prefer under a given label budget and computational budget is summarized as a practical map of which approach to prefer under a given label budget and computational budget.

Abstract

Learning from few labeled examples is a central challenge in tabular machine learning, and it becomes the binding constraint in domains where labeling is costly, such as crowd monitoring during Hajj and Umrah. Tabular foundation models, which predict from only a handful of examples without task-specific training, were recently introduced to address this very-few-label regime. In this study we test them on crowd-state classification to assess how much they help when labels are scarce, and we compare them against standard machine learning methods to characterize the accuracy and efficiency trade-offs between the two approaches. Using three real datasets we evaluate different machine learning models, in untuned and tuned forms, against three foundation models. Results show that no single family is best everywhere. The right choice depends on the label budget. When labels are very few, foundation models lead. As labels grow, tuned conventional models catch up and significantly surpass the foundation models on the more structural geometry target. Efficiency separates them further where tuned machine learning models incur a large tuning cost that foundation models avoid, although foundation models reprocess their context at every prediction. We summarize these results as a practical map of which approach to prefer under a given label budget and computational budget.

View source

Similar papers

Preprint Aug 2026

When Does Self-Supervised Pretraining Help Tabular Models? A Study of Label Scarcity and Missing Data

While SSL outperforms training from scratch on average and remains competitive with state-of-the-art tree ensembles, the SSL-vs-scratch gains exhibit high inter-task variance and lack significance, indicating the findings reflect general properties of tabular SSL rather than idiosyncrasies of one particular pretext tas...

Sahand Mazrouei · 0 citations
Preprint Aug 2026

C-Score: Beyond Accuracy for Robustness Assessment in Semi-Supervised Learning under Open-World Unlabeled Contamination

C-Score, a compact framework that evaluates training behavior in three complementary spaces: prediction, feature representation, and optimization, suggests that clean accuracy alone is insufficient for evaluating SSL robustness in open-world environments, and that internal diagnostic signals are necessary for more reli...

Tsao-Lun Chen, Chicheng Fu, Han-Yi Chou et al. · 0 citations
Preprint Sep 2026

When is Test-Time Adaptation Identifiable From Unlabeled Evidence?

Test-time adaptation (TTA) offers many ways to update a deployed model without labels, but choosing the wrong update can make a strong source model worse. Recent methods therefore try to predict which adaptation will work from unlabeled test data. We ask a prior question: does the evidence given to the selector contain...

Kartik Jhawar, Li-Po Wang · 0 citations
Preprint Aug 2026

One Knob to Rule Them All: A Unified Optimal Transport View of Cold-Start Active Learning

Cold-Start Active Learning (CSAL) aims to select a valuable subset from an unlabeled pool without any prior knowledge or human assistance. Existing methods take diverse routes based on typicality, coverage, or diversity. Each rests on its own inductive bias and therefore performs well on some tasks yet poorly on others...

Ning Zhu, Xiaochuan Ma, Jun-Tao Xu et al. · 0 citations

Class-Balanced Softmax: A Bayes Theory-Based Method for Long-Tailed Recognition

This work characterises a fundamental phenomenon in models trained on imbalanced data, termed the preference issue, wherein models exhibit higher training error and a larger generalisation gap for classes with limited data and demonstrates that CBS effectively mitigates the preference issue.

Yi-Hang Zhu, Rajeev Raman, Shiqi Su et al. · 0 citations
#artificial intelligence Preprint Aug 2026

Forget or Fine-tune? A Comparative Study of Machine Unlearning Strategies for Noisy Label Correction

This work conducts a comparative empirical study of five MU methods across symmetric, asymmetric, instance-dependent, and open-set noise on CIFAR-10, CIFAR-100, and the real-world noisy dataset Food-101N and finds that the appropriate unlearning strategy is conditioned on the noise structure.

J. L. Sant'Ana, Filipe R. Cordeiro · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.