2016 IEEE Symposium Series on Computational Intelligence (SSCI) 2016
DOI: 10.1109/ssci.2016.7850204
|View full text |Cite
|
Sign up to set email alerts
|

Principled Evolutionary Algorithm search operator design and the kernel trick

Abstract: Configuring an Evolutionary Algorithm (EA) can be a haphazard and inefficient process. An EA practitioner may have to choose between a plethora of search operator types and other parameter settings. In contrast, the goal of EA principled design is a more streamlined and systematic design methodology, which first seeks to better understand the problem domain, and only then uses such acquired insights to guide the choice of parameters and operators. We introduce a new approach to principled design of EAs based o… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
2
1

Relationship

1
2

Authors

Journals

citations
Cited by 3 publications
(4 citation statements)
references
References 21 publications
0
4
0
Order By: Relevance
“…A second motivation has been our interest in the use of kernel methods [39] in the principled design of Evolutionary Algorithms (EA) and EA search operators [26,27]. At the core of every kernel model is a kernel function that is chosen to match the inherent statistical characteristics of the problem domain at hand.…”
Section: Kernel Methodsmentioning
confidence: 99%
“…A second motivation has been our interest in the use of kernel methods [39] in the principled design of Evolutionary Algorithms (EA) and EA search operators [26,27]. At the core of every kernel model is a kernel function that is chosen to match the inherent statistical characteristics of the problem domain at hand.…”
Section: Kernel Methodsmentioning
confidence: 99%
“…Kernel trick is a function that takes as inputs vectors in the original space and returns the dot product of the vectors in the feature space is called a kernel function also referred to as kernel trick. It finally returns a similarity score between any two points, which can be considered as a metric of closeness [46,47].…”
Section: Second Featurementioning
confidence: 99%
“…One promising exception is the recent study by Lane et al [25]. They propose the use of kernels in the context of evolutionary search operators.…”
Section: Integration I: Search Operators and Kernelsmentioning
confidence: 99%
“…They propose the use of kernels in the context of evolutionary search operators. As the very same kernels may then be employed in the optimization algorithm (here: an evolutionary algorithm) as well as the model (e.g., Kriging or SVMs) Lane et al [25] state that this might lead to a more seamless integration between EAs and kernel-based surrogate models being used to augment them.…”
Section: Integration I: Search Operators and Kernelsmentioning
confidence: 99%