Pith. sign in

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

arxiv 2109.06716 v3 pith:AWGFQFON submitted 2021-09-14 cs.LG

classification cs.LG
keywords hpobenchbenchmarksmulti-fidelitybenchmarkoptimizationtoolscomputationallyproblems
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. OpenAlex reports about 9 citations worldwide. Full citation record

  1. Selecting Hyperparameters for Tree-Boosting

    cs.LG 2026-02 conditional novelty 5.0 of 10

    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.

  2. Bencher: Simple and Reproducible Benchmarking for Black-Box Optimization

    cs.LG 2025-05 conditional novelty 5.0 of 10

    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.

  3. The Gittins Index: A Design Principle for Decision-Making Under Uncertainty

    math.OC 2025-06 conditional novelty 2.0 of 10

    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.

Pith tools