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 ArticleDOI
Developing a predictive method based on optimized M5Rules–GA predicting heating load of an energy-efficient building system
TL;DR: The M5Rules has been proposed as the best predictive network in this study and combined with the GA optimization algorithm to estimate the amount of heating load mitigation from an EEB (energy efficiency buildings) system.
Biologically-Inspired Computing Approaches To Cognitive Systems: a partial tour of the literature
TL;DR: This review is intended as a rapid tour through the area (rather than a leisurely wander); and it should be readable in a few hours.
Journal ArticleDOI
Attaining flexibility in seru production system by means of Shojinka: An optimization model and solution approaches
TL;DR: A comprehensive optimization model is proposed by placing an emphasis on achieving Shojinka, which is a Japanese word, and the structural properties, the lower and upper bounds are presented to aid the understanding of the problem.
Journal ArticleDOI
On the Benefits and Risks of Using Fitness Sharing for Multimodal Optimisation
TL;DR: It is shown theoretically and empirically that large offspring populations in ( μ + λ ) EA s can be detrimental as creating too many offspring in one particular area of the search space can make all individuals in this area go extinct.
Journal ArticleDOI
A BRILS metaheuristic for non-smooth flow-shop problems with failure-risk costs
TL;DR: This paper analyzes a realistic variant of the Permutation Flow-Shop Problem (PFSP) by considering a non-smooth objective function that takes into account not only the traditional makespan cost but also failure-risk costs due to uninterrupted operation of machines.
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.