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
Journal Article
The Use of Genetic Algorithms and Neural Networks to Approximate Missing Data in Database.
Mussa Abdella,Tshilidzi Marwala +1 more
TL;DR: In this paper, a new method aimed at approximating missing data in a database using a combination of genetic algorithms and neural networks is introduced, which uses genetic algorithm to minimise an error function derived from an auto-associative neural network.
Journal ArticleDOI
Escaping Local Optima Using Crossover With Emergent Diversity
Duc-Cuong Dang,Tobias Friedrich,Timo Kötzing,Martin S. Krejca,Per Kristian Lehre,Pietro S. Oliveto,Dirk Sudholt,Andrew M. Sutton +7 more
TL;DR: It is shown that the interplay of crossover followed by mutation may serve as a catalyst leading to a sudden burst of diversity, leading to significant improvements of the expected optimization time compared to mutation-only algorithms like the (1 + 1) evolutionary algorithm.
Journal ArticleDOI
Creativity and Discovery as Blind Variation: Campbell's (1960) BVSR Model after the Half-Century Mark:
TL;DR: The authors assesses and extends Campbell's (1960) classic theory that creativity and discovery depend on blind variation and selective retention (BVSR), with special attention given to blind vari...
Journal ArticleDOI
Optimal resolution of en route conflicts
TL;DR: In this paper, the authors present mathematical modeling for en route conflict resolution, discuss the mathematical complexity of this problem, and show that classical mathematical optimization techniques can be used to solve it.
Journal ArticleDOI
State-of-the-art in aerodynamic shape optimisation methods
TL;DR: This review provides comprehensive but straightforward insight for non-specialists and reference detailing the current state for specialist practitioners by analysing the limitations, drawbacks, and the benefits of the most utilised optimisation approaches.
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.