Proceedings ArticleDOI
On genetic algorithms
Eric B. Baum,Dan Boneh,Charles Garrett +2 more
- pp 230-239
Reads0
Chats0
TLDR
C Culling is near optimal for this problem, highly noise tolerant, and the best known a~~roach in some regimes, and some new large deviation bounds on this submartingale enable us to determine the running time of the algorithm.Abstract:
We analyze the performance of a Genetic Type Algorithm we call Culling and a variety of other algorithms on a problem we refer to as ASP. Culling is near optimal for this problem, highly noise tolerant, and the best known a~~roach . . in some regimes. We show that the problem of learning the Ising perception is reducible to noisy ASP. These results provide an example of a rigorous analysis of GA’s and give insight into when and how C,A’s can beat competing methods. To analyze the genetic algorithm, we view it as a special type of submartingale. We prove some new large deviation bounds on this submartingale w~ich enable us to determine the running time of the algorithm.read more
Citations
More filters
Book ChapterDOI
Large-scale global optimization using cooperative coevolution with variable interaction learning
TL;DR: A new CC framework named Cooperative Coevolution with Variable Interaction Learning (CCVIL), which initially considers all variables as independent and puts each of them into a separate group, and discovers their relations and merges the groups accordingly.
Journal ArticleDOI
Max-min surrogate-assisted evolutionary algorithm for robust design
TL;DR: This paper presents a novel evolutionary algorithm based on the combination of a max-min optimization strategy with a Baldwinian trust-region framework employing local surrogate models for reducing the computational cost associated with robust design problems.
Journal ArticleDOI
Barnacles Mating Optimizer: A new bio-inspired algorithm for solving engineering optimization problems
TL;DR: A novel bio-inspired optimization algorithm namely the Barnacles Mating Optimizer (BMO) algorithm to solve optimization problems that mimics the mating behaviour of barnacles in nature for solving optimization problems.
Journal ArticleDOI
An intelligent system for spam detection and identification of the most relevant features based on evolutionary Random Weight Networks
Hossam Faris,Ala' M. Al-Zoubi,Ali Asghar Heidari,Ibrahim Aljarah,Majdi Mafarja,Mohammad A. Hassonah,Hamido Fujita +6 more
TL;DR: An intelligent detection system that is based on Genetic Algorithm and Random Weight Network is proposed to deal with email spam detection tasks and can automatically identify the most relevant features of the spam emails.
Journal ArticleDOI
An improved grasshopper optimization algorithm with application to financial stress prediction
TL;DR: The improved GOA which combines three strategies to achieve a more suitable balance between exploitation and exploration was established and the proposed learning scheme can guarantee a more stable kernel extreme learning machine model with higher predictive performance compared to others.
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.
Genetic algorithms in search, optimization and machine learning
TL;DR: This book brings together the computer techniques, mathematical tools, and research results that will enable both students and practitioners to apply genetic algorithms to problems in many fields.
Book
Adaptation in natural and artificial systems
TL;DR: Names of founding work in the area of Adaptation and modiication, which aims to mimic biological optimization, and some (Non-GA) branches of AI.
Book ChapterDOI
Probability Inequalities for sums of Bounded Random Variables
TL;DR: In this article, upper bounds for the probability that the sum S of n independent random variables exceeds its mean ES by a positive number nt are derived for certain sums of dependent random variables such as U statistics.
Book
The Probabilistic Method
TL;DR: A particular set of problems - all dealing with “good” colorings of an underlying set of points relative to a given family of sets - is explored.