Default Machine Learning Hyperparameters Do Not Provide Informative Initialization for Bayesian Optimization
Not on the map. Why?
Abstract (arXiv)
Bayesian Optimization (BO) is a standard tool for hyperparameter tuning thanks to its sample efficiency on expensive black-box functions. While most BO pipelines begin with uniform random initialization, default hyperparameter values shipped with popular ML libraries such as scikit-learn encode implicit expert knowledge and could serve as informative starting points that accelerate convergence. This hypothesis, despite its intuitive appeal, has remained largely unexamined. We formalize the idea by initializing BO with points drawn from truncated Gaussian distributions centered at library defaults and compare the resulting trajectories against a uniform-random baseline. We conduct an extensive empirical evaluation spanning three BO back-ends (BoTorch, Optuna, Scikit-Optimize), three model families (Random Forests, Support Vector Machines, Multilayer Perceptrons), and five benchmark datasets covering classification and regression tasks. Performance is assessed through convergence speed and final predictive quality, and statistical significance is determined via one-sided binomial tests. Across all conditions, default-informed initialization yields no statistically significant advantage over purely random sampling, with p-values ranging from 0.141 to 0.908. A sensitivity analysis on the prior variance confirms that, while tighter concentration around the defaults improves early evaluations, this transient benefit vanishes as optimization progresses, leaving final performance unchanged. Our results provide no evidence that default hyperparameters encode useful directional information for optimization. We therefore recommend that practitioners treat hyperparameter tuning as an integral part of model development and favor principled, data-driven search strategies over heuristic reliance on library defaults.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 14 of its 18 references that are in the map. First posted on arXiv 9 Feb 2026.
Builds on
14 of 18 references.
References · 14
- 2018A Tutorial on Bayesian Optimizationcited by 744
- 2015Deep Kernel Learningcited by 445
- 2019Scalable Global Optimization via Local Bayesian Optimizationcited by 374
- 2017Max-value Entropy Search for Efficient Bayesian Optimizationcited by 206
- 2014Predictive Entropy Search for Efficient Global Optimization of Black-box Functionscited by 204
- 2013Bayesian Optimization in a Billion Dimensions via Random Embeddingscited by 182
- 2023Unexpected Improvements to Expected Improvement for Bayesian Optimizationcited by 149
- 2021Bayesian Optimization is Superior to Random Search for Machine Learning Hyperparameter Tuning: Analysis of the Black-Box Optimization Challenge 2020cited by 148
- 2015Batch Bayesian Optimization via Local Penalizationcited by 104
- 2019Practical Multi-fidelity Bayesian Optimization for Hyperparameter Tuningcited by 93
- 2023Transfer Learning for Bayesian Optimization: A Surveycited by 27
- 2021Transfer Learning with Gaussian Processes for Bayesian Optimizationcited by 26
2 more
Built on by
Citing papers per year: 2026: 1.
1 paper.
- 2026KGATE : a Knowledge Graph Embedding Training Environmentcited by 0
- 2026KGATE : a Knowledge Graph Embedding Training Environment7 Oct 2026