LLMs as In-Context Meta-Learners for Model and Hyperparameter Selection
Youssef Attia El Hili, Albert Thomas, Malik Tiomoko, Abdelhakim Benechehab, Corentin L\'eger, Corinne Ancourt, Bal\'azs K\'egl

TL;DR
This paper explores how large language models can serve as in-context meta-learners to recommend models and hyperparameters based on dataset metadata, reducing the need for search and expert input.
Contribution
It introduces a novel approach where LLMs are used for model and hyperparameter selection via in-context learning, demonstrating effectiveness without traditional search methods.
Findings
LLMs can recommend competitive models and hyperparameters using dataset metadata.
Meta-informed prompting improves LLM performance in model selection.
LLMs show capacity for in-context meta-learning across benchmarks.
Abstract
Model and hyperparameter selection are critical but challenging in machine learning, typically requiring expert intuition or expensive automated search. We investigate whether large language models (LLMs) can act as in-context meta-learners for this task. By converting each dataset into interpretable metadata, we prompt an LLM to recommend both model families and hyperparameters. We study two prompting strategies: (1) a zero-shot mode relying solely on pretrained knowledge, and (2) a meta-informed mode augmented with examples of models and their performance on past tasks. Across synthetic and real-world benchmarks, we show that LLMs can exploit dataset metadata to recommend competitive models and hyperparameters without search, and that improvements from meta-informed prompting demonstrate their capacity for in-context meta-learning. These results highlight a promising new role for LLMs…
Peer Reviews
Decision·Submitted to ICLR 2026
S1. Simple and practical setup: A Clean metadata template makes outputs trainable and reproducible. S2. Single-pass: Gets a set of candidates at once without multiple prompting, easy to utilize. S3. The performance on diverse types of tasks is promising.
W1. Mechanism ambiguity (meta-learning vs. knowledge bank: The evidence doesn’t separate genuine meta-learning from retrieval-ish pattern-matching. The paper just uses a structured task description as the context and lets the LLM figure out the details of the best hyperparameters. This just looks like an LLM being used as a knowledge bank, and a more comprehensive test requires an experiment to determine whether the LLM learns mappings rather than parrots "best" configs from memory. W2. Narrow
1. The proposed method is simple and easy to understand, and as shown in the Experiments section, it demonstrates strong performance compared to other baselines for the CASH problem. 2. The synthetic ridge regression experiment appears reasonable and serves as an effective validation of the motivation behind the proposed methodology. 3. The authors evaluated the proposed method on a sufficiently large dataset -- 22 Kaggle tabular challenges spanning both regression and classification -- which
1. The paper appears to lack novelty. The proposed *Meta-informed* approach seems to be a straightforward application of an in-context learning method to the CASH problem. It would be helpful to more clearly articulate what distinguishes this approach from existing *zero-shot* or *in-context learning (ICL)* paradigms. 2. The paper does not sufficiently explain the rationale, intuition, or assumptions underlying why the proposed method works. For example, examining the model’s internal mechanism
1. **Novelty of Approach:** The paper introduces a new paradigm for the CASH problem, treating the LLM as an in-context meta-learner. This "one-shot" recommendation (rather than iterative search) is an important and insightful exploration in contrast to traditional HPO and AutoML methods (e.g., Bayesian Optimization). 2. **Significant Efficiency and Performance:** Under a fixed low-budget (10 model configurations), the Meta-Informed strategy's average performance across 22 Kaggle tasks signific
**1. Generality of Claims:** The paper's main conclusions are drawn from evaluations on Kaggle tabular tasks and a limited set of four (primarily tree-based) model families. This represents a significant simplification of the full CASH problem. The authors should discuss the challenges of extending this method to broader task domains (e.g., time series, NLP/CV) and more diverse model libraries (e.g., linear models, deep tabular models), as the generality of the current claims is questionable. *
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMachine Learning and Data Classification · Explainable Artificial Intelligence (XAI) · Artificial Intelligence in Healthcare and Education
