REVIEW 3 cited by
HPOBench: A Collection of Reproducible Multi-Fidelity Benchmark Problems for HPO
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
To achieve peak predictive performance, hyperparameter optimization (HPO) is a crucial component of machine learning and its applications. Over the last years, the number of efficient algorithms and tools for HPO grew substantially. At the same time, the community is still lacking realistic, diverse, computationally cheap, and standardized benchmarks. This is especially the case for multi-fidelity HPO methods. To close this gap, we propose HPOBench, which includes 7 existing and 5 new benchmark families, with a total of more than 100 multi-fidelity benchmark problems. HPOBench allows to run this extendable set of multi-fidelity HPO benchmarks in a reproducible way by isolating and packaging the individual benchmarks in containers. It also provides surrogate and tabular benchmarks for computationally affordable yet statistically sound evaluations. To demonstrate HPOBench's broad compatibility with various optimization tools, as well as its usefulness, we conduct an exemplary large-scale study evaluating 13 optimizers from 6 optimization tools. We provide HPOBench here: https://github.com/automl/HPOBench.
Forward citations
Cited by 3 Pith papers
-
Selecting Hyperparameters for Tree-Boosting
SMAC beats TPE, GP-based Bayesian optimization, random grid, Hyperband, and deterministic grid for tuning tree-boosting on 59 OpenML datasets, with no small hyperparameter subset safely left at defaults.
-
Bencher: Simple and Reproducible Benchmarking for Black-Box Optimization
Bencher isolates each benchmark in a virtual environment and exposes a unified RPC interface, supporting a large set of benchmarks for black-box optimization evaluation.
-
The Gittins Index: A Design Principle for Decision-Making Under Uncertainty
The Gittins index is presented as a general design principle that optimally solves many independent-chain decision problems and gives strong approximate solutions in Bayesian optimization and tail-latency scheduling.
Discussion (0). Continue with ORCID to comment.