F-Race and Iterated F-Race: An Overview
The DOI matches its Crossref record; 62 of the 63 references it cites were found in a registry or an index.
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
“Particularly, it was conceived for the statistical selection of candidate solutions when (i) the problem instances are stochastic and (ii) the solutions comprise discrete and continuous parameter spaces 55,63,64 .”
From Automatic design of stigmergy-based behaviours for robot swarms (2024) · cites this paper as [64]
Citations
Cites
Model selection and multimodel inference: a practical information-theoretic approach.
Guthery, F. S., Burnham, K. P., & Anderson, D. R. (2003) · The Journal of Wildlife Management · doi:10.2307/3802723 · Cited by 41,495 · cited 1×
“The racing approach originated from the machine learning community (Maron and Moore 1994), where it was first proposed for solving the model selection problem (Burnham and Anderson 2002).”
MethodLecture Notes in Computer Science 1205
(1999) · Industrial Robot: An International Journal · doi:10.1108/ir.1999.04926fae.001 · Cited by 38,662
Nonparametric Statistics for the Behavioral Sciences
Guitton, H., & Siegel, S. (1958) · Revue économique · doi:10.2307/3498751 · Cited by 35,245
Probability, Random Variables, and Stochastic Processes.
Abrahams, J., & Papoulis, A. (1984) · Journal of the American Statistical Association · doi:10.2307/2288754 · Cited by 16,226
Practical Nonparametric Statistics
Groggel, D. J. (2000) · Technometrics · doi:10.1080/00401706.2000.10486067 · Cited by 11,041
Probability, Random Variables, and Stochastic Processes
Miller, I. (1966) · Technometrics · doi:10.1080/00401706.1966.10490365 · Cited by 8,452
Nonparametric Statistics for the Behavioral Sciences.
Whitfield, J. W., & Siegel, S. (1957) · Journal of the Royal Statistical Society. Series A (General) · doi:10.2307/2342828 · Cited by 7,947
(2007) · Handbook of Approximation Algorithms and Metaheuristics · doi:10.1201/9781420010749-33 · Cited by 6,607
PE, & Billingsley, P. (1996) · Journal of the American Statistical Association · doi:10.2307/2291440 · Cited by 6,481
Handbook of Parametric and Nonparametric Statistical Procedures
(2004) · Technometrics · doi:10.1198/tech.2004.s209 · Cited by 4,661
Research works printed but not linked: 5
- Becker S (2004) Racing-Verfahren für Tourenplanungsprobleme. Diplomarbeit, Technische Universität Darmstadt, Darmstadt, Germany
- Birattari M (2004a) On the estimation of the expected performance of a metaheuristic on a class of instances. How many instances, how many runs? Tech. Rep. TR/IRIDIA/2004-001, IRIDIA, Université Libre de Bruxelles, Brussels, Belgium
- Manfrin M (2003) Metaeuristiche per la costruzione degli orari dei corsi universitari. Tesi di Laurea, Università degli Studi di Firenze, Firenze, Italy, in Italian
- Philemotte C, Bersini H (2008) The gestalt heuristic: learning the right level of abstraction to better search the optima. Tech. Rep. TR/IRIDIA/2008-021, IRIDIA, Université Libre de Bruxelles, Belgium
- Risler M, Chiarandini M, Paquete L, Schiavinotto T, Stützle T (2004) An algorithm for the car sequencing problem of the ROADEF 2005 challenge. Tech. Rep. AIDA–04–06, FG Intellektik, TU Darmstadt, Darmstadt, Germany
Cited by
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
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
“I/F-Race was proposed [4, 8] as an extension of F-Race in order to search the configuration space more effectively by focusing on the most promising configurations.”
MethodSelf-citationHyperparameters and tuning strategies for random forest
Probst, P., Wright, M. N., & Boulesteix, A. (2019) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1301 · Cited by 1,640
Hyperparameter optimization: Foundations, algorithms, best practices, and open challenges
Bischl, B., Binder, M., Lang, M., Pielok, T., Richter, J., Coors, S., Thomas, J., Ullmann, T., Becker, M., Boulesteix, A., et al. (2023) · WIREs Data Mining and Knowledge Discovery · doi:10.1002/widm.1484 · Cited by 930
“The iterated racing (IR, Birattari et al., 2010) procedure is a general algorithm configuration method that optimizes for a configuration of a general (not necessarily ML) algorithm that performs well over a given distribution of (arbitrary) problems.”
MethodParameter tuning for configuring and analyzing evolutionary algorithms
Eiben, A. E., & Smit, S. K. (2011) · Swarm and Evolutionary Computation · doi:10.1016/j.swevo.2011.02.001 · Cited by 622
“For instance, [4] uses the names qualitative , and quantitative parameters, [5] distinguishes symbolic and numeric parameters, [6] calls them categorical and numerical , while [7] refers to structural and behavioral parameters.”
Metadata
- Authors
- Birattari, M., Yuan, Z., Balaprakash, P., & Stützle, T.
- Affiliations
- Université Libre de Bruxelles (BE)
- Corresponding author
- Birattari, Mauro
- Yuan, Zhi
- Balaprakash, Prasanna
- Stützle, Thomas
- Venue
- Experimental Methods for the Analysis of Optimization Algorithms
- Publisher
- Springer Berlin Heidelberg
- Published
- 2010
- Pages
- 311-336
- OpenAlex
- W1499307573
- Cited by
- 413
- References
- 63
- Citations by year
- 2026: 10 · 2025: 17 · 2024: 22 · 2023: 35 · 2022: 31 · 2021: 43 · 2020: 40 · 2019: 30 · 2018: 23 · 2017: 26 · 2016: 18 · 2015: 30 · 2014: 31 · 2013: 29 · 2012: 11
- FWCI
- 32.04
- Type
- book chapter
- Language
- en
- Open access
- closed
- Licence
- www.springernature.com/gp/researchers/text-and-data-mining (tdm)
- www.springernature.com/gp/researchers/text-and-data-mining (vor)
- Locations
- Springer eBooks (publishedVersion)
- Dépôt institutionnel de l'Université libre de Bruxelles (Université Libre de Bruxelles) (submittedVersion)
- 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 › Evolutionary Algorithms and Applications
- Keywords
- automatic algorithm configuration, stochastic evaluation, hyperparameter optimization, hard optimization problems
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: F-Race and Iterated F-Race: An Overview. https://app.cochat.ai/papers/10.1007/978-3-642-02538-9_13
- The paper
- Birattari, M., Yuan, Z., Balaprakash, P., & Stützle, T. (2010). F-Race and Iterated F-Race: An Overview. Experimental Methods for the Analysis of Optimization Algorithms. https://doi.org/10.1007/978-3-642-02538-9_13
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.