Melola Discovery

← Melola Discovery

Jurnal SINTA 2

Performance Evaluation of TabPFN for Student Depression Prediction Across Varying Sample Sizes

Jurnal Ilmu Komputer dan Informasi (JIKI) · Vol. 19 No. 2 (2026) · pp. 169–177

DOI
10.21609/jiki.v19i2.1716
ISSN
2502-9274, 2088-7051
Published
2026-07-22
Publisher
Faculty of Computer Science - Universitas Indonesia
Language
eng

Abstract

Early prediction of depression in students is a critical challenge, often hindered by the scarcity of large, labelled datasets. While supervised tabular classifiers such as Random Forest, XGBoost, and CatBoost are powerful, they typically require sufficient data and careful hyperparameter optimisation (HPO) to generalise effectively. This paper evaluates the Tabular Prior-data Fitted Network (TabPFN), a foundation model for supervised tabular learning, as a zero-shot classifier for student depression prediction. We conduct a comparative study against five robustly configured baseline classifiers (Random Forest, XGBoost, CatBoost, SVM, and Naive Bayes) across three publicly available student mental health datasets of varying sizes sourced from Kaggle: a micro-sample dataset with 101 instances, a small-sample dataset with 7,022 instances, and a moderate-sample dataset with 27,901 instances. Dataset categorization by size is defined relative to TabPFN v2.5's operational capacity of 50,000 samples rather than general machine learning conventions. Using F1-Score as the primary evaluation metric, our empirical results demonstrate a performance crossover linked to data size. On the microsample, imbalanced dataset, TabPFN achieved the highest F1-Score of 0.727, outperforming the best baseline (CatBoost and Random Forest, F1 = 0.667). In the ablation study, both raw and preprocessed inputs yielded identical results for TabPFN on this dataset, highlighting its capacity to handle unprocessed data without performance loss. On the small and moderate datasets, the tuned baselines were competitive or superior, with CatBoost leading on the moderate-sample dataset (F1 = 0.869). We conclude that TabPFN is an effective and efficient baseline for depression prediction tasks in datascarce environments, providing competitive results without HPO, while traditional ensembles remain preferred for larger datasets.

Collaboration network of the authors

7 authors · 21 co-authorship links

Hover or tap a name to highlight its co-authors. Double-click to open the author's page.

  • State University of Semarang
  • Affiliation unknown
  • Different organisations
  • Same organisation
  • Affiliation unknown
  • Thicker line = more joint articles · bigger circle = more articles
Show as table
Co-authorOrganisationJoint articles

Affiliations come from OpenAlex; journal OAI-PMH metadata carries none. Authors without an OpenAlex ID are matched by name, which can merge or split people.

Metadata source: OAI-PMH (metadata jurnal) https://jiki.cs.ui.ac.id/index.php/jiki/oai, first harvested 26 Okt 2026, last seen 26 Okt 2026.
Original metadata (oai_dc)
<oai_dc:dc xmlns="http://www.openarchives.org/OAI/2.0/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:oai_dc="http://www.openarchives.org/OAI/2.0/oai_dc/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/  http://www.openarchives.org/OAI/2.0/oai_dc.xsd">
	<dc:title xml:lang="en-US">Performance Evaluation of TabPFN for Student Depression Prediction Across Varying Sample Sizes</dc:title>
	<dc:creator>Arini, Florentina Yuni</dc:creator>
	<dc:creator>Syah, Muhammad Kahvi Khakam</dc:creator>
	<dc:creator>Setiawan, Fernando Dinar</dc:creator>
	<dc:creator>Indarto, Rafif Musyaffa</dc:creator>
	<dc:creator>Aminuddin, Muhammad Danil</dc:creator>
	<dc:creator>Fairuz Trideas Hilmy</dc:creator>
	<dc:creator>Mutaqin, Ahmad Imam</dc:creator>
	<dc:description xml:lang="en-US">Early prediction of depression in students is a critical challenge, often hindered by the scarcity of large, labelled datasets. While supervised tabular classifiers such as Random Forest, XGBoost, and CatBoost are powerful, they typically require sufficient data and careful hyperparameter optimisation (HPO) to generalise effectively. This paper evaluates the Tabular Prior-data Fitted Network (TabPFN), a foundation model for supervised tabular learning, as a zero-shot classifier for student depression prediction. We conduct a comparative study against five robustly configured baseline classifiers (Random Forest, XGBoost, CatBoost, SVM, and Naive Bayes) across three publicly available student mental health datasets of varying sizes sourced from Kaggle: a micro-sample dataset with 101 instances, a small-sample dataset with 7,022 instances, and a moderate-sample dataset with 27,901 instances. Dataset categorization by size is defined relative to TabPFN v2.5's operational capacity of 50,000 samples rather than general machine learning conventions. Using F1-Score as the primary evaluation metric, our empirical results demonstrate a performance crossover linked to data size. On the microsample, imbalanced dataset, TabPFN achieved the highest F1-Score of 0.727, outperforming the best baseline (CatBoost and Random Forest, F1 = 0.667). In the ablation study, both raw and preprocessed inputs yielded identical results for TabPFN on this dataset, highlighting its capacity to handle unprocessed data without performance loss. On the small and moderate datasets, the tuned baselines were competitive or superior, with CatBoost leading on the moderate-sample dataset (F1 = 0.869). We conclude that TabPFN is an effective and efficient baseline for depression prediction tasks in datascarce environments, providing competitive results without HPO, while traditional ensembles remain preferred for larger datasets.</dc:description>
	<dc:publisher xml:lang="en-US">Faculty of Computer Science  - Universitas Indonesia</dc:publisher>
	<dc:date>2026-07-22</dc:date>
	<dc:type>info:eu-repo/semantics/article</dc:type>
	<dc:type>info:eu-repo/semantics/publishedVersion</dc:type>
	<dc:format>application/pdf</dc:format>
	<dc:identifier>https://jiki.cs.ui.ac.id/index.php/jiki/article/view/1716</dc:identifier>
	<dc:identifier>10.21609/jiki.v19i2.1716</dc:identifier>
	<dc:source xml:lang="en-US">Jurnal Ilmu Komputer dan Informasi; Vol. 19 No. 2 (2026): Jurnal Ilmu Komputer dan Informasi (Journal of Computer Science and Information); 169-177</dc:source>
	<dc:source>2502-9274</dc:source>
	<dc:source>2088-7051</dc:source>
	<dc:source>10.21609/jiki.v19i2</dc:source>
	<dc:language>eng</dc:language>
	<dc:relation>https://jiki.cs.ui.ac.id/index.php/jiki/article/view/1716/565</dc:relation>
	<dc:rights xml:lang="en-US">Copyright (c) 2026 Jurnal Ilmu Komputer dan Informasi</dc:rights>
</oai_dc:dc>