Table of Contents
Fetching ...

Pre-Hoc Predictions in AutoML: Leveraging LLMs to Enhance Model Selection and Benchmarking for Tabular datasets

Yannis Belkhiter, Seshu Tirupathi, Giulio Zizzo, Sachin Sharma, John D. Kelleher

TL;DR

The paper tackles the high computational cost of post-hoc AutoML by proposing a pre-hoc framework that uses dataset statistics, OpenML textual descriptions, and retrieval-augmented generation to pre-select suitable algorithms on tabular data. It combines traditional pre-hoc predictors with an LLM-based AutoML agent, evaluated on the AWS AutoGluon TabRepo portfolio of 175 OpenML datasets. Results show traditional pre-hoc methods benefit from descriptive signals (e.g., RoBERTa) and can outperform simple baselines, while LLM-based agents offer promising but currently lagging performance that improves with RAG and few-shot guidance. The work demonstrates a viable path to reducing AutoML search space and computational overhead, while emphasizing the value of rich dataset metadata and open benchmarks for future improvements.

Abstract

The field of AutoML has made remarkable progress in post-hoc model selection, with libraries capable of automatically identifying the most performing models for a given dataset. Nevertheless, these methods often rely on exhaustive hyperparameter searches, where methods automatically train and test different types of models on the target dataset. Contrastingly, pre-hoc prediction emerges as a promising alternative, capable of bypassing exhaustive search through intelligent pre-selection of models. Despite its potential, pre-hoc prediction remains under-explored in the literature. This paper explores the intersection of AutoML and pre-hoc model selection by leveraging traditional models and Large Language Model (LLM) agents to reduce the search space of AutoML libraries. By relying on dataset descriptions and statistical information, we reduce the AutoML search space. Our methodology is applied to the AWS AutoGluon portfolio dataset, a state-of-the-art AutoML benchmark containing 175 tabular classification datasets available on OpenML. The proposed approach offers a shift in AutoML workflows, significantly reducing computational overhead, while still selecting the best model for the given dataset.

Pre-Hoc Predictions in AutoML: Leveraging LLMs to Enhance Model Selection and Benchmarking for Tabular datasets

TL;DR

The paper tackles the high computational cost of post-hoc AutoML by proposing a pre-hoc framework that uses dataset statistics, OpenML textual descriptions, and retrieval-augmented generation to pre-select suitable algorithms on tabular data. It combines traditional pre-hoc predictors with an LLM-based AutoML agent, evaluated on the AWS AutoGluon TabRepo portfolio of 175 OpenML datasets. Results show traditional pre-hoc methods benefit from descriptive signals (e.g., RoBERTa) and can outperform simple baselines, while LLM-based agents offer promising but currently lagging performance that improves with RAG and few-shot guidance. The work demonstrates a viable path to reducing AutoML search space and computational overhead, while emphasizing the value of rich dataset metadata and open benchmarks for future improvements.

Abstract

The field of AutoML has made remarkable progress in post-hoc model selection, with libraries capable of automatically identifying the most performing models for a given dataset. Nevertheless, these methods often rely on exhaustive hyperparameter searches, where methods automatically train and test different types of models on the target dataset. Contrastingly, pre-hoc prediction emerges as a promising alternative, capable of bypassing exhaustive search through intelligent pre-selection of models. Despite its potential, pre-hoc prediction remains under-explored in the literature. This paper explores the intersection of AutoML and pre-hoc model selection by leveraging traditional models and Large Language Model (LLM) agents to reduce the search space of AutoML libraries. By relying on dataset descriptions and statistical information, we reduce the AutoML search space. Our methodology is applied to the AWS AutoGluon portfolio dataset, a state-of-the-art AutoML benchmark containing 175 tabular classification datasets available on OpenML. The proposed approach offers a shift in AutoML workflows, significantly reducing computational overhead, while still selecting the best model for the given dataset.

Paper Structure

This paper contains 21 sections, 2 figures, 6 tables.

Figures (2)

  • Figure 1: Statistic of model occurrence - AWS Portfolio
  • Figure 2: Metric error vs. Runtime of top rank of models