F-Race and Iterated F-Race: An Overview
Algorithms for solving hard optimization problems typically have several parameters that
need to be set appropriately such that some aspect of performance is optimized. In this …
need to be set appropriately such that some aspect of performance is optimized. In this …
Parameter tuning in metaheuristics: a bibliometric and gap analysis
Parameters are an integral part of every metaheuristic algorithm as these control different
aspects of algorithms. Thus, parameter tuning (PT) approaches are one of the prime sub …
aspects of algorithms. Thus, parameter tuning (PT) approaches are one of the prime sub …
[图书][B] Clever algorithms: nature-inspired programming recipes
J Brownlee - 2011 - books.google.com
This book provides a handbook of algorithmic recipes from the fields of Metaheuristics,
Biologically Inspired Computation and Computational Intelligence that have been described …
Biologically Inspired Computation and Computational Intelligence that have been described …
[图书][B] Tuning metaheuristics: a machine learning perspective
M Birattari, J Kacprzyk - 2009 - Springer
Metaheuristics are a relatively new but already established approach to combinatorial
optimization. A metaheuristic is a generic algorithmic template that can be used for finding …
optimization. A metaheuristic is a generic algorithmic template that can be used for finding …
Analyzing bandit-based adaptive operator selection mechanisms
Á Fialho, L Da Costa, M Schoenauer… - Annals of Mathematics and …, 2010 - Springer
Several techniques have been proposed to tackle the Adaptive Operator Selection (AOS)
issue in Evolutionary Algorithms. Some recent proposals are based on the Multi-armed …
issue in Evolutionary Algorithms. Some recent proposals are based on the Multi-armed …
Review on nature-inspired algorithms
Optimization and its related solving methods are becoming increasingly important in most
academic and industrial fields. The goal of the optimization process is to make a system or a …
academic and industrial fields. The goal of the optimization process is to make a system or a …
Hoeffding and Bernstein races for selecting policies in evolutionary direct policy search
V Heidrich-Meisner, C Igel - … of the 26th Annual International Conference …, 2009 - dl.acm.org
Uncertainty arises in reinforcement learning from various sources, and therefore it is
necessary to consider statistics based on several roll-outs for evaluating behavioral policies …
necessary to consider statistics based on several roll-outs for evaluating behavioral policies …
Selector: selecting a representative benchmark suite for reproducible statistical comparison
Fair algorithm evaluation is conditioned on the existence of high-quality benchmark datasets
that are non-redundant and are representative of typical optimization scenarios. In this …
that are non-redundant and are representative of typical optimization scenarios. In this …
Parameter tuning with Chess Rating System (CRS-Tuning) for meta-heuristic algorithms
Meta-heuristic algorithms should be compared using the best parameter values for all the
involved algorithms. However, this is often unrealised despite the existence of several …
involved algorithms. However, this is often unrealised despite the existence of several …