Papers › Hyperopt: A Python Library for Optimizing the Hyperparameters of Machine Learning Algorithms

Hyperopt: A Python Library for Optimizing the Hyperparameters of Machine Learning Algorithms

12 Dec 2013SCIPY 2013 2013 12archive 2025-07-28

James Bergstra, Dan Yamins, David D. Cox

Sequential model-based optimization (also known as Bayesian optimization) is one of the most efficient methods (per function evaluation) of function minimization. This efficiency makes it appropriate for optimizing the hyperparameters of machine learning algorithms that are slow to train. The Hyperopt library provides algorithms and parallelization infrastructure for performing hyperparameter optimization (model selection) in Python. This paper presents an introductory tutorial on the usage of the Hyperopt library, including the description of search spaces, minimization (in serial and parallel), and the analysis of the results collected in the course of minimization. The paper closes with some discussion of ongoing and future work.

PaperPDFCode

Syntology This paper has no arXiv id in the archive, and this site joins papers to Syntology's graph by arXiv id, so this page does not say whether the graph holds it.

Code

MindSpore-scientific-2/code-5 mindsporeSyntology: not harvested report
hyperopt/hyperopt Syntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to KGTuner: Efficient Hyper-parameter Search for Knowledge Graph Learning (arXiv:2205.02460; that paper's own run record: 11 ran (of which 3 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 5 where Syntology's instrument failed) · 8 unverified); nothing checks that they implement this paper's method. report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

BIG-bench Machine LearningBayesian OptimizationHyperparameter OptimizationModel Selection

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Introduced by this paper: Tree-structured Parzen Estimator Approach (TPE)

Tree-structured Parzen Estimator Approach (TPE)

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections