Fast Benchmarking of Asynchronous Multi-Fidelity Optimization on Zero-Cost Benchmarks
<|reference_start|>Fast Benchmarking of Asynchronous Multi-Fidelity Optimization on Zero-Cost Benchmarks: 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.<|reference_end|>
@article{watanabe2024fast,
    title={Fast Benchmarking of Asynchronous Multi-Fidelity Optimization on
  Zero-Cost Benchmarks},
    author={Shuhei Watanabe and Neeratyoy Mallik and Edward Bergman and Frank
  Hutter},
    journal={arXiv preprint arXiv:2403.01888},
    year={2024},
    archivePrefix={arXiv},
    eprint={2403.01888},
    primaryClass={cs.AI cs.LG}
}