The DOI matches its Crossref record; 27 of the 27 references it cites were found in a registry or an index.
Sequential Model-Based Optimization for General Algorithm Configuration
Overview
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
In the citing paper
“Recent studies have shown that other optimisation algorithms are suitable for the AutoMoDe family (e.g., simulated annealing 65 and sequential model-based algorithm configuration 66,67 ).”
From Automatic design of stigmergy-based behaviours for robot swarms (2024) · cites this paper as [66]
In the citing paper
“SMBO iteratively updates the surrogate model while exploring promising data points33.”
From Data-driven de novo design of super-adhesive hydrogels (2025) · cites this paper as [33]
In the citing paper
“Among nine ML models benchmarked (Supplementary Tables 5 and 6), Gaussian process (GP)32 and random forest regression (RFR)33 emerged as the most effective base models for predicting Fa from ϕi, achieving low test error while minimizing overfitting (Extended Data Fig. 4).”
From Data-driven de novo design of super-adhesive hydrogels (2025) · cites this paper as [33]
Citations
Cites
Breiman, L. (2001) · Machine Learning · doi:10.1023/a:1010933404324 · Cited by 133,538
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
The Elements of Statistical Learning
Hastie, T., Friedman, J., & Tibshirani, R. (2001) · Springer Series in Statistics · doi:10.1007/978-0-387-21606-5 · Cited by 24,162
Efficient Global Optimization of Expensive Black-Box Functions
Jones, D. R., Schonlau, M., & Welch, W. J. (1998) · Journal of Global Optimization · doi:10.1023/a:1008306431147 · Cited by 8,070
ParamILS: An Automatic Algorithm Configuration Framework
Hutter, F., Hoos, H. H., Leyton-Brown, K., & Stuetzle, T. (2009) · Journal of Artificial Intelligence Research · doi:10.1613/jair.2861 · Cited by 882
Self-citationSATzilla: Portfolio-based Algorithm Selection for SAT
Xu, L., Hutter, F., Hoos, H. H., & Leyton-Brown, K. (2008) · Journal of Artificial Intelligence Research · doi:10.1613/jair.2490 · Cited by 857
Self-citationMinimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
Minton, S., Johnston, M. D., Philips, A. B., & Laird, P. (1992) · Artificial Intelligence · doi:10.1016/0004-3702(92)90007-k · Cited by 843
Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
Etessami, K., & Yannakakis, M. (2009) · Journal of the ACM · doi:10.1145/1462153.1462154 · Cited by 512
A Racing Algorithm for Configuring Metaheuristics
Birattari, M., Stützle, T., Paquete, L., & Varrentrapp, K. (2002) · Cited by 498
Fine-Tuning of Algorithms Using Fractional Experimental Designs and Local Search
Adenso-Díaz, B., & Laguna, M. (2006) · Operations Research · doi:10.1287/opre.1050.0243 · Cited by 435
Cited by
nnU-Net: a self-configuring method for deep learning-based biomedical image segmentation
Isensee, F., Jaeger, P. F., Kohl, S. A. A., Petersen, J., & Maier-Hein, K. H. (2021) · Nature Methods · doi:10.1038/s41592-020-01008-z · Cited by 10,477
Larian Studios Dev Team (2024) · doi:10.1145/3292500.3330701 · Cited by 8,618
“Hyperparameter optimization softwares such as Hyperopt [4], Spearmint [28], SMAC [10], Autotune [15], and Vizier [8] were all developed in order to meet this need.”
MethodInfluential(2012) · Cited by 8,009
Greff, K., Srivastava, R. K., Koutnik, J., Steunebrink, B. R., & Schmidhuber, J. (2017) · IEEE Transactions on Neural Networks and Learning Systems · doi:10.1109/tnnls.2016.2582924 · Cited by 6,955
“While there are other methods to efficiently search for good hyperparameters [43], [44], random search has several advantages for our setting: it is easy to implement, trivial to parallelize, and covers the search space more uniformly, thereby improving the follow-up analysis of hyperparameter importance.”
MethodPractical 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
Metadata
- Authors
- Hutter, F., Hoos, H. H., & Leyton-Brown, K.
- Affiliations
- University of British Columbia (CA)
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2011
- Pages
- 507-523
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W60686164
- Cited by
- 2,469
- References
- 27
- Citations by year
- 2026: 101 · 2025: 154 · 2024: 197 · 2023: 221 · 2022: 265 · 2021: 344 · 2020: 297 · 2019: 277 · 2018: 176 · 2017: 142 · 2016: 101 · 2015: 89 · 2014: 60 · 2013: 28 · 2012: 13
- FWCI
- 25.79
- Type
- conference paper
- Language
- en
- Open access
- closed
- Locations
- Lecture notes in computer science (publishedVersion)
- Topics
- Physical Sciences › Computer Science › Artificial Intelligence › Metaheuristic Optimization Algorithms Research
- Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Data Classification
- Physical Sciences › Computer Science › Artificial Intelligence › Constraint Satisfaction and Optimization
- Keywords
- algorithm configuration, sequential model-based optimization, regression models, propositional satisfiability, mixed integer programming, CPLEX
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: Sequential Model-Based Optimization for General Algorithm Configuration. https://app.cochat.ai/papers/10.1007/978-3-642-25566-3_40
- The paper
- Hutter, F., Hoos, H. H., & Leyton-Brown, K. (2011). Sequential Model-Based Optimization for General Algorithm Configuration. Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-25566-3_40
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.