paper-with-me

Papers

Gradient Boosting Trees and Large Language Models for Tabular Data Few-Shot Learning

2024-11-06 · Carlos Huertas

Large Language Models (LLM) have brought numerous of new applications to Machine Learning (ML). In the context of tabular data (TD), recent studies show that TabLLM is a very powerful mechanism for few-shot-learning (FSL) applications, even if gradient boosting decisions trees (GBDT) have historically dominated the TD field. In this work we demonstrate that although LLMs are a viable alternative, the evidence suggests that baselines used to gauge performance can be improved. We replicated public benchmarks and our methodology improves LightGBM by 290%, this is mainly driven by forcing node splitting with few samples, a critical step in FSL with GBDT. Our results show an advantage to TabLLM for 8 or fewer shots, but as the number of samples increases GBDT provides competitive performance at a fraction of runtime. For other real-life applications with vast number of samples, we found FSL still useful to improve model diversity, and when combined with ExtraTrees it provides strong resilience to overfitting, our proposal was validated in a ML competition setting ranking first place.

📄 PDF Abstract BibTeX arXiv:2411.04324

Code (0)

등록된 구현이 없습니다.

Tasks

DiversityFew-Shot Learning

Similar Papers 제목 키워드 기반

MSBoost: Using Model Selection with Multiple Base Estimators for Gradient Boosting

2024-06-17 · Under review at NeurIPS 2024 6 · Agnij Moitra

Gradient boosting is a widely used machine learning algorithm for tabular regression, classification and ranking. Although, most of the open source implementations of gradient boosting such as XGBoost, LightGBM and other…

ClassificationModel Selectionregressiontabular-classification+1

Gradient Regularized Newton Boosting Trees with Global Convergence

2026-05-01 · Nikita Zozoulenko, Daniel Falkowski, Thomas Cass, Lukas Gonon arxiv

Gradient Boosting Decision Trees (GBDTs) dominate tabular machine learning, with modern implementations like XGBoost, LightGBM, and CatBoost being based on Newton boosting: a second-order descent step in the space of dec…

Neural Oblivious Decision Ensembles for Deep Learning on Tabular Data

2019-09-13 · ICLR 2020 1 · Sergei Popov, Stanislav Morozov, Artem Babenko

Nowadays, deep neural networks (DNNs) have become the main instrument for machine learning tasks within a wide range of domains, including vision, NLP, and speech. Meanwhile, in an important case of heterogenous tabular …

BIG-bench Machine LearningDeep LearningRepresentation Learning

BoostLLM: Boosting-inspired LLM Fine-tuning for Few-shot Tabular Classification

2026-05-07 · Yi-Siang Wang, Kuan-Yu Chen, Yu-Chen Den, Darby Tien-Hao Chang arxiv

Large language models (LLMs) have recently been adapted to tabular prediction by serializing structured features into natural language, but their performance in low-data regimes remains limited compared to gradient-boost…

parameter-efficient fine-tuning

Individually Fair Gradient Boosting

2021-03-31 · ICLR 2021 1 · Alexander Vargo, Fan Zhang, Mikhail Yurochkin, Yuekai Sun

We consider the task of enforcing individual fairness in gradient boosting. Gradient boosting is a popular method for machine learning from tabular data, which arise often in applications where algorithmic fairness is a …

Fairness