Hierarchical Bayesian Optimization Algorithm

This book provides a framework for the design of competent optimization techniques by combining advanced evolutionary algorithms with state-of-the-art machine learning techniques. The book focuses on two algorithms that replace traditional variation operators of evolutionary algorithms by learning and sampling Bayesian networks: the Bayesian optimization algorithm (BOA) and the hierarchical BOA (hBOA). BOA and hBOA are theoretically and empirically shown to provide robust and scalable solution for broad classes of nearly decomposable and hierarchical problems. A theoretical model is developed that estimates the scalability and adequate parameter settings for BOA and hBOA. The performance of BOA and hBOA is analyzed on a number of artificial problems of bounded difficulty designed to test BOA and hBOA on the boundary of their design envelope. The algorithms are also extensively tested on two interesting classes of real-world problems: MAXSAT and Ising spin glasses with periodic boundary conditions in two and three dimensions. Experimental results validate the theoretical model and confirm that BOA and hBOA provide robust and scalable solution for nearly decomposable and hierarchical problems with only little problem-specific information.

I’m not usually a fan of edited volumes. Too often they are an incoherent hodgepodge of remnants, renegades, or rejects foisted upon an unsuspecting reading public under a misleading or fraudulent title. The volume Scalable Optimization via Probabilistic Modeling: From Algorithms to Applications is a worthy addition to your library because it succeeds on exactly those dimensions where so many edited volumes fail. For example, take the title, Scalable Optimization via Probabilistic M- eling: From Algorithms to Applications. You need not worry that you’re going to pick up this book and ?nd stray articles about anything else. This book focuseslikealaserbeamononeofthehottesttopicsinevolutionary compu- tion over the last decade or so: estimation of distribution algorithms (EDAs). EDAs borrow evolutionary computation’s population orientation and sel- tionism and throw out the genetics to give us a hybrid of substantial power, elegance, and extensibility. The article sequencing in most edited volumes is hard to understand, but from the get go the editors of this volume have assembled a set of articles sequenced in a logical fashion. The book moves from design to e?ciency enhancement and then concludes with relevant applications. The emphasis on e?ciency enhancement is particularly important, because the data-mining perspectiveimplicitinEDAsopensuptheworldofoptimizationtonewme- ods of data-guided adaptation that can further speed solutions through the construction and utilization of e?ective surrogates, hybrids, and parallel and temporal decompositions.

This book provides a handbook of algorithmic recipes from the fields of Metaheuristics, Biologically Inspired Computation and Computational Intelligence that have been described in a complete, consistent, and centralized manner. These standardized descriptions were carefully designed to be accessible, usable, and understandable. Most of the algorithms described in this book were originally inspired by biological and natural systems, such as the adaptive capabilities of genetic evolution and the acquired immune system, and the foraging behaviors of birds, bees, ants and bacteria. An encyclopedic algorithm reference, this book is intended for research scientists, engineers, students, and interested amateurs. Each algorithm description provides a working code example in the Ruby Programming Language.

One of the main difficulties of applying an evolutionary algorithm (or, as a matter of fact, any heuristic method) to a given problem is to decide on an appropriate set of parameter values. Typically these are specified before the algorithm is run and include population size, selection rate, operator probabilities, not to mention the representation and the operators themselves. This book gives the reader a solid perspective on the different approaches that have been proposed to automate control of these parameters as well as understanding their interactions. The book covers a broad area of evolutionary computation, including genetic algorithms, evolution strategies, genetic programming, estimation of distribution algorithms, and also discusses the issues of specific parameters used in parallel implementations, multi-objective evolutionary algorithms, and practical consideration for real-world applications. It is a recommended read for researchers and practitioners of evolutionary computation and heuristic methods.

One major branch of enhancing the performance of evolutionary algorithms is the exploitation of linkage learning. This monograph aims to capture the recent progress of linkage learning, by compiling a series of focused technical chapters to keep abreast of the developments and trends in the area of linkage. In evolutionary algorithms, linkage models the relation between decision variables with the genetic linkage observed in biological systems, and linkage learning connects computational optimization methodologies and natural evolution mechanisms. Exploitation of linkage learning can enable us to design better evolutionary algorithms as well as to potentially gain insight into biological systems. Linkage learning has the potential to become one of the dominant aspects of evolutionary algorithms; research in this area can potentially yield promising results in addressing the scalability issues.

The two volume set LNCS 7491 and 7492 constitutes the refereed proceedings of the 12th International Conference on Parallel Problem Solving from Nature, PPSN 2012, held in Taormina, Sicily, Italy, in September 2012. The total of 105 revised full papers were carefully reviewed and selected from 226 submissions. The meeting began with 5 workshops which offered an ideal opportunity to explore specific topics in evolutionary computation, bio-inspired computing and metaheuristics. PPSN 2012 also included 8 tutorials. The papers are organized in topical sections on evolutionary computation; machine learning, classifier systems, image processing; experimental analysis, encoding, EDA, GP; multiobjective optimization; swarm intelligence, collective behavior, coevolution and robotics; memetic algorithms, hybridized techniques, meta and hyperheuristics; and applications.

A clear and lucid bottom-up approach to the basic principles of evolutionary algorithms Evolutionary algorithms (EAs) are a type of artificial intelligence. EAs are motivated by optimization processes that we observe in nature, such as natural selection, species migration, bird swarms, human culture, and ant colonies. This book discusses the theory, history, mathematics, and programming of evolutionary optimization algorithms. Featured algorithms include genetic algorithms, genetic programming, ant colony optimization, particle swarm optimization, differential evolution, biogeography-based optimization, and many others. Evolutionary Optimization Algorithms: Provides a straightforward, bottom-up approach that assists the reader in obtaining a clear but theoretically rigorous understanding of evolutionary algorithms, with an emphasis on implementation Gives a careful treatment of recently developed EAs including opposition-based learning, artificial fish swarms, bacterial foraging, and many others and discusses their similarities and differences from more well-established EAs Includes chapter-end problems plus a solutions manual available online for instructors Offers simple examples that provide the reader with an intuitive understanding of the theory Features source code for the examples available on the author's website Provides advanced mathematical techniques for analyzing EAs, including Markov modeling and dynamic system modeling Evolutionary Optimization Algorithms: Biologically Inspired and Population-Based Approaches to Computer Intelligence is an ideal text for advanced undergraduate students, graduate students, and professionals involved in engineering and computer science.

Genetic and evolutionary algorithms (GEAs) have often achieved an enviable success in solving optimization problems in a wide range of disciplines. This book provides effective optimization algorithms for solving a broad class of problems quickly, accurately, and reliably by employing evolutionary mechanisms.