
General-Purpose Optimization Through Information Maximization by Alan J Lockett
This book examines the mismatch between discrete programs, which lie at the center of modern applied mathematics, and the continuous space phenomena they simulate. The author considers whether we can imagine continuous spaces of programs, and asks what the structure of such spaces would be and how they would be constituted. He proposes a functional analysis of program spaces focused through the lens of iterative optimization.
The author begins with the observation that optimization methods such as Genetic Algorithms, Evolution Strategies, and Particle Swarm Optimization can be analyzed as Estimation of Distributions Algorithms (EDAs) in that they can be formulated as conditional probability distributions. The probabilities themselves are mathematical objects that can be compared and operated on, and thus many methods in Evolutionary Computation can be placed in a shared vector space and analyzed using techniques of functionalanalysis. The core ideas of this book expand from that concept, eventually incorporating all iterative stochastic search methods, including gradient-based methods. Inspired by work on Randomized Search Heuristics, the author covers all iterative optimization methods and not just evolutionary methods. The No Free Lunch Theorem is viewed as a useful introduction to the broader field of analysis that comes from developing a shared mathematical space for optimization algorithms. The author brings in intuitions from several branches of mathematics such as topology, probability theory, and stochastic processes and provides substantial background material to make the work as self-contained as possible.
The book will be valuable for researchers in the areas of global optimization, machine learning, evolutionary theory, and control theory.
-
Robot Evolution
-
An Introduction to Metaheuristics for Optimization
-
Deep Neural Evolution
-
Lectures on Intelligent Systems
-
Deep Statistical Comparison for Meta-heuristic Stochastic Optimization Algorithms
-
Coevolutionary Computation and Its Applications
-
Visions of DNA Nanotechnology at 40 for the Next 40
-
Cartesian Genetic Programming
-
Bioinspired Computation in Combinatorial Optimization
-
Self-organising Software
-
Swarm Intelligence
-
Evolution as Computation
-
Algorithmic Bioprocesses
-
Nature Inspired Optimisation for Delivery Problems
-
Experimental Research in Evolutionary Computation
-
Hyper-Heuristics: Theory and Applications
-
Modelling in Molecular Biology
-
Advances in Metaheuristics for Hard Optimization
-
Foraging-Inspired Optimisation Algorithms
-
Mobility in Process Calculi and Natural Computing
-
Automating the Design of Data Mining Algorithms
-
Contemporary Evolution Strategies
-
Theory and Principled Methods for the Design of Metaheuristics
-
Discrete and Topological Models in Molecular Biology
-
Massively Parallel Evolutionary Computation on GPGPUs
-
Multimodal Optimization by Means of Evolutionary Algorithms
-
Computation in Living Cells
-
Sensitivity Analysis for Neural Networks
-
Reservoir Computing
Alan J. Lockett received his PhD in 2012 at the University of Texas at Austin under the supervision of Risto Miikkulainen, where his research topics included estimation of temporal probabilistic models, evolutionary computation theory, and learning neural network controllers for robotics. After a postdoc in IDSIA (Lugano) with Jürgen Schmidhuber he now works for CS Disco in Houston.
| SKU | Unavailable |
| ISBN 13 | 9783662620069 |
| ISBN 10 | 3662620065 |
| Title | General-Purpose Optimization Through Information Maximization |
| Author | Alan J Lockett |
| Series | Natural Computing Series |
| Condition | Unavailable |
| Binding Type | Hardback |
| Publisher | Springer |
| Year published | 2020-08-17 |
| Number of pages | 561 |
| Cover note | Book picture is for illustrative purposes only, actual binding, cover or edition may vary. |
| Note | Unavailable |




























