Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 1,010

The DOI matches its Crossref record; 21 of the 21 references it cites were found in a registry or an index.

Hyperopt: a Python library for model selection and hyperparameter optimization

Open access
Bergstra, James, Komer, Brent, Eliasmith, Chris, Yamins, Dan, Cox, David D·2015·Computational Science & Discovery

Abstract

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. This paper also gives an overview of Hyperopt-Sklearn, a software project that provides automatic algorithm configuration of the Scikit-learn machine learning library. Following Auto-Weka, we take the view that the choice of classifier and even the choice of preprocessing module can be taken together to represent a single large hyperparameter optimization problem . We use Hyperopt to define a search space that encompasses many standard components (e.g. SVM, RF, KNN, PCA, TFIDF) and common patterns of composing them together. We demonstrate, using search algorithms in Hyperopt and standard benchmarking data sets (MNIST, 20-newsgroups, convex shapes), that searching this space is practical and effective. In particular, we improve on best-known scores for the model space for both MNIST and convex shapes. The paper closes with some discussion of ongoing and future work.

Overview

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1088/1749-4699/8/1/014008

Cites

21 of 21 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 21 references

Research works printed but not linked: 12

  1. Bergstra J, 2012, J. Mach. Learn. Res., 13, 281
  2. Bergstra J, 2011, NIPS, 24, 2546
  3. Bergstra J, 2013, Proc. ICML
  4. Bergstra J, 2013, Proc. SciPy 2013, 13
  5. Bergstra J, 2014, ICML AutoML Workshop
  6. Ciresan D, 2012, IEEE Conf. on Computer Vision and Pattern Recognition (CVPR), 3642
  7. Domhan T, 2014, ICML AutoML Workshop
  8. Eggensperger K, 2013, NIPS Workshop on Bayesian Optimization in Theory and Practice
  9. Komer B, 2014, Proc. SciPy 2014
  10. Mitchell T, 1996, Newsgroups Data Set, 20
  11. Pedregosa F, 2011, J. Mach. Learn. Res., 12, 2825
  12. Snoek J, 2012, Proc. NIPS

Cited by

See all 1,010

Metadata

Authors
Bergstra, J., Komer, B., Eliasmith, C., Yamins, D., & Cox, D. D.
Venue
Computational Science & Discovery
Published
2015-07-28
Volume
8
Issue
1
Pages
014008
ISSN
  • 1749-4680 (ISSN-L)
  • 1749-4699
OpenAlex
W1437335841
Cited by
1,010
References
21
FWCI
15.02
Type
journal article
Language
en
Open access
hybrid
Licence
Funders
NSF Office of the Director (0963668)

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Hyperopt: a Python library for model selection and hyperparameter optimization. https://app.cochat.ai/papers/10.1088/1749-4699/8/1/014008
The paper
Bergstra, J., Komer, B., Eliasmith, C., Yamins, D., & Cox, D. D. (2015). Hyperopt: a Python library for model selection and hyperparameter optimization. Computational Science & Discovery. https://doi.org/10.1088/1749-4699/8/1/014008

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.