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 accessAbstract
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.
Integrity signals
Registry
Cites
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.
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
Scikit-learn: Machine Learning in Python
Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., Blondel, M., Müller, A., Nothman, J., Louppe, G., et al. (2012) · arXiv · doi:10.48550/arxiv.1201.0490 · Cited by 71,016
Gradient-based learning applied to document recognition
Lecun, Y., Bottou, L., Bengio, Y., & Haffner, P. (1998) · Proceedings of the IEEE · doi:10.1109/5.726791 · Cited by 58,805
The Elements of Statistical Learning
Hastie, T., Tibshirani, R., & Friedman, J. (2009) · Springer Series in Statistics · doi:10.1007/978-0-387-84858-7 · Cited by 25,970
Learning Multiple Layers of Features from Tiny Images
Krizhevsky, A. (2024) · doi:10.57702/zp44cu3g · Cited by 23,395
The WEKA data mining software: an update
Hall, M., Frank, E., Holmes, G., Pfahringer, B., Reutemann, P., & Witten, I. H. (2009) · ACM SIGKDD Explorations Newsletter · doi:10.1145/1656274.1656278 · Cited by 17,750
(2012) · Cited by 8,009
Practical Bayesian Optimization of Machine Learning Algorithms
Snoek, J., Larochelle, H., & Adams, R. P. (2012) · arXiv · doi:10.48550/arxiv.1206.2944 · Cited by 6,691
Labeled Faces in the Wild: A Database forStudying Face Recognition in Unconstrained Environments
Huang, G. B., Mattar, M., Berg, T. L., & Miller, E. G. (2008) · HAL · Cited by 4,445
(2011) · Cited by 3,939
Multi-column deep neural networks for image classification
Ciresan, D., Meier, U., & Schmidhuber, J. (2012) · 2012 IEEE Conference on Computer Vision and Pattern Recognition · doi:10.1109/cvpr.2012.6248110 · Cited by 3,720
Research works printed but not linked: 12
- Bergstra J, 2012, J. Mach. Learn. Res., 13, 281
- Bergstra J, 2011, NIPS, 24, 2546
- Bergstra J, 2013, Proc. ICML
- Bergstra J, 2013, Proc. SciPy 2013, 13
- Bergstra J, 2014, ICML AutoML Workshop
- Ciresan D, 2012, IEEE Conf. on Computer Vision and Pattern Recognition (CVPR), 3642
- Domhan T, 2014, ICML AutoML Workshop
- Eggensperger K, 2013, NIPS Workshop on Bayesian Optimization in Theory and Practice
- Komer B, 2014, Proc. SciPy 2014
- Mitchell T, 1996, Newsgroups Data Set, 20
- Pedregosa F, 2011, J. Mach. Learn. Res., 12, 2825
- Snoek J, 2012, Proc. NIPS
Cited by
Larian Studios Dev Team (2024) · doi:10.1145/3292500.3330701 · Cited by 8,618
“Spearmint [2] and GPyOpt use Gaussian Processes, and Hyperopt [1] employs tree-structured Parzen estimator (TPE) [6].”
MethodOn hyperparameter optimization of machine learning algorithms: Theory and practice
Yang, L., & Shami, A. (2020) · Neurocomputing · doi:10.1016/j.neucom.2020.07.061 · Cited by 3,232
Tabular data: Deep learning is not all you need
Shwartz-Ziv, R., & Armon, A. (2022) · Information Fusion · doi:10.1016/j.inffus.2021.11.011 · Cited by 2,172
Single-cell RNA-seq denoising using a deep count autoencoder
Eraslan, G., Simon, L. M., Mircea, M., Mueller, N. S., & Theis, F. J. (2019) · Nature Communications · doi:10.1038/s41467-018-07931-2 · Cited by 1,084
Rahman, A., Srikumar, V., & Smith, A. D. (2018) · Applied Energy · doi:10.1016/j.apenergy.2017.12.051 · Cited by 743
Metadata
- Authors
- Bergstra, J., Komer, B., Eliasmith, C., Yamins, D., & Cox, D. D.
- Venue
- Computational Science & Discovery
- Publisher
- IOP Publishing
- 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
- iopscience.iop.org/info/page/text-and-data-mining (tdm)
- iopscience.iop.org/page/copyright (vor)
- creativecommons.org/licenses/by-nc-nd/3.0 (am, 366 d)
- 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.