The reviewed record of science sign in
Pith

arxiv: 2109.09831 · v2 · pith:4AOP2YWL · submitted 2021-09-20 · cs.LG · stat.ML

SMAC3: A Versatile Bayesian Optimization Package for Hyperparameter Optimization

Reviewed by Pithpith:4AOP2YWLopen to challenge →

classification cs.LG stat.ML
keywords optimizationsmac3algorithmsbayesianhyperparameterhyperparametersofferspackage
0
0 comments X
read the original abstract

Algorithm parameters, in particular hyperparameters of machine learning algorithms, can substantially impact their performance. To support users in determining well-performing hyperparameter configurations for their algorithms, datasets and applications at hand, SMAC3 offers a robust and flexible framework for Bayesian Optimization, which can improve performance within a few evaluations. It offers several facades and pre-sets for typical use cases, such as optimizing hyperparameters, solving low dimensional continuous (artificial) global optimization problems and configuring algorithms to perform well across multiple problem instances. The SMAC3 package is available under a permissive BSD-license at https://github.com/automl/SMAC3.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. ASAP: Agent-System Co-Design for Wall-Clock-Centered Auto HPO Research for ML Experiments

    cs.LG 2026-06 unverdicted novelty 7.0

    ASAP integrates an LLM agent over a pool of HPO tools and adds system-level optimizations (prefix-stable prompts, speculation parallelism, Self-Tuner) to improve end-to-end wall-clock performance on diverse HPO tasks.

  2. Auto-FP: An Experimental Study of Automated Feature Preprocessing for Tabular Data

    cs.LG 2023-10 unverdicted novelty 7.0

    Experimental comparison of 15 HPO and NAS algorithms for automated feature preprocessing on 45 tabular datasets finds evolution-based methods and random search as top performers.

  3. QuickScope: Certifying Hard Questions in Dynamic LLM Benchmarks

    cs.CL 2026-04 unverdicted novelty 6.0

    QuickScope uses modified COUP Bayesian optimization to find truly difficult questions in dynamic LLM benchmarks more sample-efficiently than baselines while cutting false positives.