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
Generic Evolutionary Design
TL;DR: This paper introduces generic evolutionary design by a computer, describing a system capable of the evolution of a wide range of solid object designs from scratch, using a genetic algorithm.
Journal ArticleDOI
A Novel Complex-Valued Encoding Grey Wolf Optimization Algorithm
TL;DR: Compared to the real-valued GWO algorithm and other optimization algorithms; the CGWO performs significantly better in terms of accuracy; robustness; and convergence speed.
Journal ArticleDOI
Multidimensional Exploration of Software Implementationsfor DSP Algorithms
TL;DR: The objective in this paper is to compute a full range of Pareto-optimal solutions for solving this multi-objective optimization problem, and an evolutionary algorithm based approach is applied.
Proceedings ArticleDOI
Minimum Number of Generations Required for Convergence of Genetic Algorithms
TL;DR: There exists a minimum number of GA generations before the members of a population will converge to a solution for a given optimization problem, and this increases with the size of the problem.
Journal ArticleDOI
Minimizing energy consumption and makespan in a two-machine flowshop scheduling problem
S. Afshin Mansouri,Emel Aktas +1 more
TL;DR: This work develops constructive heuristics and multi-objective genetic algorithms (MOGA) for a two-machine sequence-dependent permutation flowshop problem to address the trade-off between energy consumption and makespan as a measure of service level and shows that MOGAs hybridized with constructiveHeuristics outperform regular MOGA and heuristic alone in terms of quality and cardinality of Pareto frontier.
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.