Fast Benchmarking of Asynchronous Multi-Fidelity Optimization on Zero-Cost Benchmarks
Not on the map. Why?
Abstract (arXiv)
While deep learning has celebrated many successes, its results often hinge on the meticulous selection of hyperparameters (HPs). However, the time-consuming nature of deep learning training makes HP optimization (HPO) a costly endeavor, slowing down the development of efficient HPO tools. While zero-cost benchmarks, which provide performance and runtime without actual training, offer a solution for non-parallel setups, they fall short in parallel setups as each worker must communicate its queried runtime to return its evaluation in the exact order. This work addresses this challenge by introducing a user-friendly Python package that facilitates efficient parallel HPO with zero-cost benchmarks. Our approach calculates the exact return order based on the information stored in file system, eliminating the need for long waiting times and enabling much faster HPO evaluations. We first verify the correctness of our approach through extensive testing and the experiments with 6 popular HPO libraries show its applicability to diverse libraries and its ability to achieve over 1000x speedup compared to a traditional approach. Our package can be installed via pip install mfhpo-simulator.
Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 24 of its 44 references that are in the map. First posted on arXiv 4 Mar 2024.
Builds on
24 of 44 references.
References · 24
- 2019Optuna: A Next-generation Hyperparameter Optimization Frameworkcited by 2,501
- 2016Hyperband: A Novel Bandit-Based Approach to Hyperparameter Optimizationcited by 699
- 2018BOHB: Robust and Efficient Hyperparameter Optimization at Scalecited by 470
- 2020NAS-Bench-201: Extending the Scope of Reproducible Neural Architecture Searchcited by 416
- 2018Tune: A Research Platform for Distributed Model Selection and Trainingcited by 395
- 2021SMAC3: A Versatile Bayesian Optimization Package for Hyperparameter Optimizationcited by 230
- 2021TrivialAugment: Tuning-free Yet State-of-the-Art Data Augmentationcited by 227
- 2015Non-stochastic Best Arm Identification and Hyperparameter Optimizationcited by 221
- 2018A System for Massively Parallel Hyperparameter Tuningcited by 202
- 2023Tree-Structured Parzen Estimator: Understanding Its Algorithm Components and Their Roles for Better Empirical Performancecited by 147
- 2017Multi-fidelity Bayesian Optimisation with Continuous Approximationscited by 121
- 2021HPOBench: A Collection of Reproducible Multi-Fidelity Benchmark Problems for HPOcited by 112
12 more
- 2020HEBO Pushing The Limits of Sample-Efficient Hyperparameter Optimisationcited by 83
- 2021HPO-B: A Large-Scale Reproducible Benchmark for Black-Box HPO based on OpenMLcited by 75
- 2019Tuning Hyperparameters without Grad Students: Scalable and Robust Bayesian Optimisation with Dragonflycited by 67
- 2021YAHPO Gym -- An Efficient Multi-Objective Multi-Fidelity Benchmark for Hyperparameter Optimizationcited by 62
- 2021On the Importance of Hyperparameter Optimization for Model-based Reinforcement Learningcited by 59
- 2019Tabular Benchmarks for Joint Architecture and Hyperparameter Optimizationcited by 58
- 2022NAS-Bench-Suite: NAS Evaluation is (Now) Surprisingly Easycited by 36
- 2022On the Importance of Hyperparameters and Data Augmentation for Self-Supervised Learningcited by 16
- 2022Hyper-Tune: Towards Efficient Hyper-parameter Tuning at Scalecited by 13
- 2022c-TPE: Tree-structured Parzen Estimator with Inequality Constraints for Expensive Hyperparameter Optimizationcited by 9
- 2024Multi-Fidelity Methods for Optimization: A Surveycited by 6
- 2023Python Wrapper for Simulating Multi-Fidelity Optimization on HPO Benchmarks without Any Waitcited by 2
Built on by
Citing papers per year: 2025: 2.
2 papers.