The DOI matches its Crossref record; 30 of the 30 references it cites were found in a registry or an index.
Sequential Parameter Optimization
Abstract
Sequential parameter optimization is a heuristic that combines classical and modern statistical techniques to improve the performance of search algorithms. To demonstrate its flexibility, three scenarios are discussed: (1) no experience how to choose the parameter setting of an algorithm is available, (2) a comparison with other algorithms is needed, and (3) an optimization algorithm has to be applied effectively and efficiently to a complex real-world optimization problem. Although sequential parameter optimization relies on enhanced statistical techniques such as design and analysis of computer experiments, it can be performed algorithmically and requires basically the specification of the relevant algorithm's parameters.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Classification and Regression Trees.
Gordon, A. D., Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1984) · Biometrics · doi:10.2307/2530946 · Cited by 23,522
(2005) · Technometrics · doi:10.1198/tech.2005.s303 · Cited by 17,923
A new optimizer using particle swarm theory
Eberhart, R., & Kennedy, J. (2002) · MHS'95. Proceedings of the Sixth International Symposium on Micro Machine and Human Science · doi:10.1109/mhs.1995.494215 · Cited by 16,067
R: A Language for Data Analysis and Graphics
Ihaka, R., & Gentleman, R. (1996) · Journal of Computational and Graphical Statistics · doi:10.1080/10618600.1996.10474713 · Cited by 11,220
McKay, M. D., Beckman, R. J., & Conover, W. J. (2000) · Technometrics · doi:10.2307/1271432 · Cited by 7,415
Design and Analysis of Computer Experiments
Sacks, J., Welch, W. J., Mitchell, T. J., & Wynn, H. P. (1989) · Statistical Science · doi:10.1214/ss/1177012413 · Cited by 6,919
Fisher, R. A. (1936) · BMJ · doi:10.1136/bmj.1.3923.554-a · Cited by 4,980
Gunst, R. F. (1999) · Technometrics · doi:10.1080/00401706.1999.10485680 · Cited by 4,002
Empirical study of particle swarm optimization
Shi, Y., & Eberhart, R. C. (2003) · Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406) · doi:10.1109/cec.1999.785511 · Cited by 3,945
McKay, M. D., Beckman, R. J., & Conover, W. J. (1979) · Technometrics · doi:10.2307/1268522 · Cited by 3,757
Evolution strategies – A comprehensive introduction
Beyer, H.-G., & Schwefel, H.-P. (2002) · Natural Computing · doi:10.1023/a:1015059928466 · Cited by 2,790
Schwefel, H. (1995) · Cited by 2,203
The Design and Analysis of Computer Experiments
Santner, T. J., Williams, B. J., & Notz, W. I. (2003) · Springer Series in Statistics · doi:10.1007/978-1-4757-3799-8 · Cited by 2,170
Evolutionary Algorithms for Constrained Parameter Optimization Problems
Michalewicz, Z., & Schoenauer, M. (1996) · Evolutionary Computation · doi:10.1162/evco.1996.4.1.1 · Cited by 1,718
Comparison between genetic algorithms and particle swarm optimization
Eberhart, R. C., & Shi, Y. (1998) · Lecture Notes in Computer Science · doi:10.1007/bfb0040812 · Cited by 1,610
Error and the Growth of Experimental Knowledge
Mayo, D. G. (1996) · doi:10.7208/chicago/9780226511993.001.0001 · Cited by 1,325
The Theory of Evolution Strategies
Beyer, H.-G. (2001) · Natural Computing Series · doi:10.1007/978-3-662-04378-3 · Cited by 878
An R and S-Plus Companion to Applied Regression
Millar, P., & Fox, J. (2003) · Canadian Journal of Sociology / Cahiers canadiens de sociologie · doi:10.2307/3341881 · Cited by 630
Empirical methods for artificial intelligence
(1996) · Choice Reviews Online · doi:10.5860/choice.33-5144 · Cited by 625
Statistical tools for simulation practitioners
(1990) · Mathematics and Computers in Simulation · doi:10.1016/0378-4754(90)90147-b · Cited by 528
Flehinger, B. J. (1976) · Technometrics · doi:10.1080/00401706.1976.10489459 · Cited by 494
Computational capabilities of recurrent NARX neural networks
Siegelmann, H. T., Horne, B. G., & Giles, C. L. (1997) · IEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics) · doi:10.1109/3477.558801 · Cited by 455
Global versus local search in constrained optimization of computer models
Schonlau, M., Welch, W. J., & Jones, D. R. (1998) · Institute of Mathematical Statistics Lecture Notes - Monograph Series · doi:10.1214/lnms/1215456182 · Cited by 435
Data Analysis and Graphics Using R – an Example-Based Approach
Maindonald, J., & Braun, W. J. (2010) · Cambridge University Press eBooks · doi:10.1017/cbo9781139194648 · Cited by 428
Computer experiments and global optimization
Welch, W. J., & Schonlau, M. (1997) · Library and Archives Canada (Government of Canada) · Cited by 382
Tuning search algorithms for real-world applications: a regression tree based approach
Bartz–Beielstein, T., & Markon, S. (2004) · IEEE Congress on Evolutionary Computation (CEC) · doi:10.1109/cec.2004.1330986 · Cited by 89
Self-citationDesign and Analysis of Optimization Algorithms Using Computational Statistics
Bartz–Beielstein, T., Parsopoulos, K. E., & Vrahatis, M. N. (2004) · Applied Numerical Analysis & Computational Mathematics · doi:10.1002/anac.200410007 · Cited by 71
Self-citationNew experimentalism applied to evolutionary computation
Bartz–Beielstein, T. (2005) · Technische Universität Dortmund Eldorado (Technische Universität Dortmund) · doi:10.17877/de290r-15667 · Cited by 26
Self-citationDesigning particle swarm optimization with regression trees
Bartz–Beielstein, T., Parsopoulos, K. E., de Vegt, M., et al. (2004) · Technische Universität Dortmund Eldorado (Technische Universität Dortmund) · doi:10.17877/de290r-5432 · Cited by 10
Self-citationTotal synthesis of algorithmic chemistries
Lasarczyk, C. W. G., & Banzhaf, W. (2005) · Genetic and Evolutionary Computation Conference (GECCO) · doi:10.1145/1068009.1068285 · Cited by 8
Self-citation
Cited by
Taking the Human Out of the Loop: A Review of Bayesian Optimization
Shahriari, B., Swersky, K., Wang, Z., Adams, R. P., & de Freitas, N. (2016) · Proceedings of the IEEE · doi:10.1109/jproc.2015.2494218 · Cited by 6,049
Sequential Model-Based Optimization for General Algorithm Configuration
Hutter, F., Hoos, H. H., & Leyton-Brown, K. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25566-3_40 · Cited by 2,469
Brochu, E., Cora, V. M., & de Freitas, N. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1012.2599 · Cited by 2,011
The irace package: Iterated racing for automatic algorithm configuration
López-Ibáñez, M., Dubois-Lacoste, J., Pérez Cáceres, L., Birattari, M., & Stützle, T. (2016) · Operations Research Perspectives · doi:10.1016/j.orp.2016.09.002 · Cited by 1,761
Exploration and exploitation in evolutionary algorithms: A survey
Črepinšek, M., Liu, S.-H., & Mernik, M. (2013) · ACM Computing Surveys · doi:10.1145/2480741.2480752 · Cited by 1,298
Metadata
- Authors
- Bartz-Beielstein, T., Lasarczyk, C. W. G., & Preuss, M.
- Venue
- 2005 IEEE Congress on Evolutionary Computation
- Publisher
- IEEE
- Published
- 2005-12-13
- Volume
- 1
- Pages
- 773-780
- OpenAlex
- W2117643431
- Cited by
- 300
- References
- 30
- FWCI
- 3.34
- Type
- conference paper
- Language
- en
- Open access
- closed
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
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.