scispace - formally typeset
Open AccessProceedings Article

On evolutionary optimization with approximate fitness functions

Reads0
Chats0
TLDR
It is found that the evolutionary algorithm will converge incorrectly if the approximate model has false optima, so two strategies to control the evolution process are introduced and methods to eliminate false minima in neural network training are proposed.
Abstract
The evaluation of the quality of solutions is usually very time-consuming in design optimization. Therefore, time-efficient approximate models can be particularly beneficial for the evaluation when evolutionary algorithms are applied. In this paper, the convergence property of an evolution strategy (ES) with neural network based fitness evaluations is investigated. It is found that the evolutionary algorithm will converge incorrectly if the approximate model has false optima. To address this problem, two strategies to control the evolution process are introduced. In addition, methods to eliminate false minima in neural network training are proposed. The effectiveness of the methods are shown with simulation studies on the Ackley function and the Rosenbrock function.

read more

Citations
More filters
Journal ArticleDOI

Evolutionary optimization in uncertain environments-a survey

TL;DR: This paper attempts to provide a comprehensive overview of the related work within a unified framework on addressing different uncertainties in evolutionary computation, which has been scattered in a variety of research areas.
Journal ArticleDOI

A comprehensive survey of fitness approximation in evolutionary computation

TL;DR: A comprehensive survey of the research on fitness approximation in evolutionary computation is presented, main issues like approximation levels, approximate model management schemes, model construction techniques are reviewed and open questions and interesting issues in the field are discussed.
Journal ArticleDOI

Surrogate-assisted evolutionary computation: Recent advances and future challenges

TL;DR: This paper provides a concise overview of the history and recent developments in surrogate-assisted evolutionary computation and suggests a few future trends in this research area.
Journal ArticleDOI

A framework for evolutionary optimization with approximate fitness functions

TL;DR: A framework for managing approximate models in generation-based evolution control is proposed, well suited for parallel evolutionary optimization, which is able to guarantee the correct convergence of the evolutionary algorithm, as well as to reduce the computation cost as much as possible.
Journal ArticleDOI

Generalizing Surrogate-Assisted Evolutionary Computation

TL;DR: The generalized evolutionary framework focuses on attaining reliable search performance in the surrogate-assisted evolutionary framework by working on two major issues: to mitigate the 'curse of uncertainty' robustly, and to benefit from the 'bless of uncertainty.'
References
More filters
Book

Genetic algorithms in search, optimization, and machine learning

TL;DR: In this article, the authors present the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields, including computer programming and mathematics.
Book

Neural networks for pattern recognition

TL;DR: This is the first comprehensive treatment of feed-forward neural networks from the perspective of statistical pattern recognition, and is designed as a text, with over 100 exercises, to benefit anyone involved in the fields of neural computation and pattern recognition.
Book ChapterDOI

Neural Networks for Pattern Recognition

TL;DR: The chapter discusses two important directions of research to improve learning algorithms: the dynamic node generation, which is used by the cascade correlation algorithm; and designing learning algorithms where the choice of parameters is not an issue.
Journal ArticleDOI

The design and analysis of computer experiments

TL;DR: This paper presents a meta-modelling framework for estimating Output from Computer Experiments-Predicting Output from Training Data and Criteria Based Designs for computer Experiments.
Journal ArticleDOI

Response surface methodology

TL;DR: In this article, the Response Surface Methodology (RSM) is used for scheduling and scheduling in response surface methodologies, and it is shown that it can be used in a variety of scenarios.
Related Papers (5)