Pith. sign in

REVIEW 4 cited by

Bayesian Optimization is Superior to Random Search for Machine Learning Hyperparameter Tuning: Analysis of the Black-Box Optimization Challenge 2020

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 2104.10201 v2 pith:R7IUKOM2 submitted 2021-04-20 cs.LG cs.AIstat.ML

classification cs.LGcs.AIstat.ML
keywords optimizationlearningmachineblack-boxchallengetuningbayesianhyperparameter
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

This paper presents the results and insights from the black-box optimization (BBO) challenge at NeurIPS 2020 which ran from July-October, 2020. The challenge emphasized the importance of evaluating derivative-free optimizers for tuning the hyperparameters of machine learning models. This was the first black-box optimization challenge with a machine learning emphasis. It was based on tuning (validation set) performance of standard machine learning models on real datasets. This competition has widespread impact as black-box optimization (e.g., Bayesian optimization) is relevant for hyperparameter tuning in almost every machine learning project as well as many applications outside of machine learning. The final leaderboard was determined using the optimization performance on held-out (hidden) objective functions, where the optimizers ran without human intervention. Baselines were set using the default settings of several open-source black-box optimization packages as well as random search.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

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

  1. Are encoders able to learn landmarkers for warm-starting of Hyperparameter Optimization?

    cs.LG 2025-07 conditional novelty 5.0 of 10

    Encoders trained to reproduce landmarker distances capture that structure, but the resulting representations do not significantly improve warm-starting of Bayesian hyperparameter optimization.

  2. Predicting Extubation Failure in Intensive Care: The Development of a Novel, End-to-End Actionable and Interpretable Prediction System

    cs.LG 2024-11 conditional novelty 5.0 of 10

    A fusion of LSTM and TCN models built from sampling-frequency feature subsets achieved only modest extubation-failure prediction (AUC-ROC about 0.6) on 4,701 MIMIC-IV patients.

  3. Modernizing HEBO: a robust Bayesian optimization baseline for practical heteroskedastic and non-stationary problems

    cs.LG 2026-07 conditional novelty 4.0 of 10

    tidyHEBO modernizes HEBO in BoTorch and shows competitive-to-better, more robust sequential optimization on scientific and HPO benchmarks under default hyperparameters.

  4. Machine Learning for Complex Instrument Design and Optimization

    physics.ins-det 2026-07 unverdicted novelty 1.0 of 10

    A review chapter summarizing machine-learning pipelines for complex instrument operations and design, with no new experimental or theoretical contribution.

Pith tools