When Is an LLM Worth It for Hyperparameter Optimization? A Budget-Matched Study on Tabular Data Finds the Warm-Start Is a Default Configuration, Not the Model
Not on the map. Why?
Abstract (arXiv)
Large language models (LLMs) have been proposed as hyperparameter-optimization (HPO) advisors that "warm-start" search from prior knowledge, proposing strong configurations in very few evaluations. We test that claim under a budget-matched, multi-seed protocol on eight PMLB tabular benchmarks, comparing an LLM advisor (LLM-OptFlow) against four classical baselines (random search, Optuna-TPE, Gaussian-process Bayesian optimization, and successive halving) over one shared search space, with paired tests and bootstrap 95% CIs across 8 x 5 = 40 (task, seed) units. The finding is cautionary. The advisor's strong first point is not an LLM output at all: like prior LLM-HPO systems the loop is seeded with a fixed default configuration, evaluated before any model call, which alone reaches 88.7% mean best-CV, identical to within 0.01 pp across all seven advisor models tested. The LLM's own proposals add only +0.40 pp of cross-validation accuracy over that seed and nothing on held-out test (LLM-Default = -0.01 pp, p = 0.92). When the same seed is granted to classical search, the apparent lead collapses: against seeded random search it leads by +0.20 pp at 2 evaluations, is tied by 5, and is behind by 12 (-0.37 pp). Without the seed, classical search ties the advisor by 12 evaluations and beats it by 40 (+0.6 to +0.8 pp, p <= 1e-4). Two LLM-specific behaviors survive: a single-task exploration failure (vehicle), and a rule-based confidence filter that removes ~33% of wasted compute without changing accuracy. The recommendation is deflationary: on tabular HPO, seed classical search with a sensible default; an LLM advisor adds no measurable generalization benefit and is overtaken within a handful of evaluations. We release the harness and a script that reproduces every statistic.
Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 13 of its 20 references that are in the map. First posted on arXiv 19 Jun 2026.
Builds on
13 of 20 references.
References · 13
- 2019Optuna: A Next-generation Hyperparameter Optimization Frameworkcited by 2,455
- 2023Large Language Models as Optimizerscited by 830
- 2016Hyperband: A Novel Bandit-Based Approach to Hyperparameter Optimizationcited by 688
- 2025GEPA: Reflective Prompt Evolution Can Outperform Reinforcement Learningcited by 449
- 2024MLE-bench: Evaluating Machine Learning Agents on Machine Learning Engineeringcited by 429
- 2023MLAgentBench: Evaluating Language Agents on Machine Learning Experimentationcited by 339
- 2017PMLB: A Large Benchmark Suite for Machine Learning Evaluation and Comparisoncited by 139
- 2024Large Language Models to Enhance Bayesian Optimizationcited by 127
- 2024Large Language Model Agent for Hyper-Parameter Optimizationcited by 62
- 2024Sequential Large Language Model-Based Hyper-parameter Optimizationcited by 23
- 2024Revisiting OPRO: The Limitations of Small-Scale LLMs as Optimizerscited by 14
- 2025Small LLMs with Expert Blocks Are Good Enough for Hyperparamter Tuningcited by 2
1 more
Built on by
Citing papers per year: 2026: 4.
4 papers.
- 2026Interactive Training 2: Auditable Control Plane for Live Model Trainingcited by 0
- 2026When Do Learned Diffusion Proposals Help Constraint Solving? A Controlled Study on Continuous Algebraic Systemscited by 0
- 2026Identical Runs, Different Results: Benchmarking AI Coding Agents on Open-Weight Modelscited by 0
- 2026Prior or Feedback? What an LLM Uses When Adapting Neural Operatorscited by 0
- 2026Prior or Feedback? What an LLM Uses When Adapting Neural Operators8 Oct 2026
- 2026Identical Runs, Different Results: Benchmarking AI Coding Agents on Open-Weight Models27 Sep 2026
- 2026When Do Learned Diffusion Proposals Help Constraint Solving? A Controlled Study on Continuous Algebraic Systems29 Jul 2026
- 2026Interactive Training 2: Auditable Control Plane for Live Model Training17 Jul 2026